Ars Combinatoria

ISSN 0381-7032 (print), 2817-5204 (online)

Ars Combinatoria is the oldest Canadian Journal of Combinatorics, established in 1976. The journal is dedicated to advancing the field of combinatorial mathematics through the publication of high-quality research papers. From 2024 onward, it publishes four volumes per year in March, June, September and December. Ars Combinatoria has gained recognition and visibility in the academic community and is indexed in renowned databases such as MathSciNet, Zentralblatt, and Scopus. The Scope of the journal includes Graph theory, Design theory, Extremal combinatorics, Enumeration, Algebraic combinatorics, Combinatorial optimization, Ramsey theory, Automorphism groups, Coding theory, Finite geometries, Chemical graph theory but not limited.

Quan-Hui Yang1, Min Tang2
1School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing, 210044, P. R. China
2Department of Mathematics, Anhui Normal University, Wuhu 241003, China
Abstract:

Motzkin posed the problem of finding the maximal density μ(M) of sets of integers in which the differences given by a set M do not occur. The problem is already settled when |M|2 or M is a finite arithmetic progression. In this paper, we determine μ(M) when M has some other structure. For example, we determine μ(M) when M is a finite geometric progression.

S.V.Ullas Chandran1, A.P. Santhakumaran2
1 Department of Mathematics Mahatma Gandhi College Kesavdaspuram. Thiruvananthapuram – 695 004, India
2 Department of Mathematics Hindustan University Hindustan Institute of Technology and Science Padur, Chennai-603 103, India
Abstract:

For vertices u,v in a connected graph G, a uv chordless path in G is a uv monophonic path. The monophonic interval JG[u,v] consists of all vertices lying on some uv monophonic path in G. For SV(G), the set JG[S] is the union of all sets JG[u,v] for u,vS. A set SV(G) is a monophonic set of G if JG[S]=V(G). The cardinality of a minimum monophonic set of G is the monophonic number of G, denoted by mn(G). In this paper, bounds for the monophonic number of the strong product graphs are obtained, and for several classes, improved bounds and exact values are obtained.

Zengtai Gong1, Qian Wang1,2
1College of Mathematics and Statistics, Northwest Normal University, Lanzhou, 730070, P.R.China
2Colleage of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou, 730030, P.R.China
Abstract:

A hypergraph is a useful tool to model complex systems and can be considered a natural generalization of graphs. In this paper, we define some operations of fuzzy hypergraphs and strong fuzzy r-uniform hypergraphs, such as Cartesian product, strong product, normal product, lexicographic product, union, and join. We prove that if a hypergraph H is formed by one of these operations, then this hypergraph is a fuzzy hypergraph or a strong fuzzy r-uniform hypergraph. Finally, we discuss an application of fuzzy hypergraphs.

Shi-Chao Chen1
1 Institute of Contemporary Mathematics Department of Mathematics and Information Sciences, Henan University, Kaifeng, 475001, China
Abstract:

Let pe(n) be the number of ways to make change for n cents using pennies, nickels, dimes, and quarters. By manipulating the generating function for pe(n), we prove that the sequence {pe(n)(modj)} is periodic for every prime power .

Weihua Yang1, Wei-Hua He2, Hao Li2, Xingchao Deng3
1Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, China
2Laboratoire de Recherche en Informatique, UMR 8623, C.N.B.S., Université de Paris-sud,91405-Orsay cedex, France
3College of Mathematical Science, Tianjin Normal University, Tianjin-300387, P. R. China
Abstract:

In 1972, Chvatal and Erdős showed that the graph G with independence number α(G) no more than its connectivity κ(G) (i.e., κ(G)α(G)) is hamiltonian. In this paper, we consider a kind of Chvatal and Erdős type condition on edge-connectivity λ(G) and matching number (edge independence number). We show that if λ(G)α(G)1, then G is either supereulerian or in a well-defined family of graphs. Moreover, we weaken the condition κ(G)α(G)1 in [11] to λ(G)α(G)1 and obtain a similar characterization on non-supereulerian graphs. We also characterize the graph which contains a dominating closed trail under the assumption λ(G)α(G)2.

Renfang Wu1, Hanyuan Deng1
1College of Mathematics and Computer Science, Hunan Normal University, Changsha, Hunan 410081, P. R. China
Abstract:

The coloring number col(G) of a graph G is the smallest number k for which there exists a linear ordering of the vertices of G such that each vertex is preceded by fewer than k of its neighbors. It is well known that χ(G)col(G) for any graph G, where χ(G) denotes the chromatic number of G. The Randić index R(G) of a graph G is defined as the sum of the weights 1d(u)d(v) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. We show that χ(G)col(G)2R(G)R(G) for any connected graph G with at least one edge, and col(G)=2R(G) if and only if G is a complete graph with some pendent edges attaching to its same vertex, where R(G) is a modification of Randić index, defined as the sum of the weights 1max{d(u),d(v)} of all edges uv of G. This strengthens a relation between Randić index and chromatic number by Hansen et al. [7], a relation between Randić index and coloring number by Wu et al. [17] and extends a theorem of Deng et al. [2].

P. Tirus1, P. Balakrishnan1
1Department of Mathematics University College of Engineering Nagercoil Anna University :: Chennai Negercoil – 629 004, India.
Abstract:

For any vertex x in a connected graph G of order n2, a set SV(G) is a z-detour monophonic set of G if each vertex vV(G) lies on a xy detour monophonic path for some element yS. The minimum cardinality of a x-detour monophonic set of G is the x-detour monophonic number of G, denoted by dmz(G). An x-detour monophonic set Sx of G is called a minimal x-detour monophonic set if no proper subset of Sx is an x-detour monophonic set. The upper x-detour monophonic number of G, denoted by dmx+(G), is defined as the maximum cardinality of a minimal x-detour monophonic set of G. We determine bounds for it and find the same for some special classes of graphs. For positive integers r,d, and k with 2rd and k2, there exists a connected graph G with monophonic radius r, monophonic diameter d, and upper z-detour monophonic number k for some vertex x in G. Also, it is shown that for positive integers j,k,l, and n with 2jkln7, there exists a connected graph G of order n with dmx(G)=j, dmx+(G)=l, and a minimal x-detour monophonic set of cardinality k.

Gwang Yeon Lee1, Mustafa Asci2
1DEPARTMENT OF MATHEMATICS HANSEO UNIVERSITY SEOSAN CHUNGNAM 356-706, Korea
2PAMUKKALE UNIVERSITY SCIENCE AND ARTS FACULTY DEPARTMENT OF MATHEMATICS DeEnizLi TURKEY
Abstract:

Many authors define certain generalizations of the usual Fibonacci, Pell, and Lucas numbers by matrix methods and then obtain the Binet formulas and combinatorial representations of the generalizations of these number sequences. In this article, we firstly define and study the generalized Gaussian Fibonacci numbers and then find the matrix representation of the generalized Gaussian Fibonacci numbers and prove some theorems by these matrix representations.

Le Anh Vinh1
1 University of Education Vietnam National University, Hanoi
Abstract:

Given two sets A,BFq, of elements of the finite field Fq, of q elements, Shparlinski (2008) showed that the product set AB={abaA,bB} contains an arithmetic progression of length k3 provided that \(k

3\) is the characteristic of F, and |A||B|2q21/(k1). In this paper, we recover Shparlinski’s result for the case of 3-term arithmetic progressions via spectra of product graphs over finite fields. We also illustrate our method in the setting of residue rings. Let m be a large integer and Z/mZ be the ring of residues mod m. For any two sets A,BZ/mZ of cardinality |A||B|>m(r(m)mr(m)12+1), the product set AB contains a 3-term arithmetic progression, where r(m) is the smallest prime divisor of m and r(m) is the number of divisors of m. The spectral proofs presented in this paper avoid the use of character and exponential sums, the usual tool to deal with problems of this kind.

Petros A.Petrosyan1,2
1Department of Informatics and Applied Mathematics, Yerevan State University, 0025, Armenia
2Institute for Informatics and Automation Problems, National Academy of Sciences, 0014, Armenia
Abstract:

A proper edge-coloring of a graph G with colors 1,,t is called an interval t-coloring if the colors of edges incident to any vertex of G form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, the least value of t for which G has an interval t-coloring is denoted by w(G). A graph G is outerplanar if it can be embedded in the plane so that all its vertices lie on the same (unbounded) face. In this paper, we show that if G is a 2-connected outerplanar graph with Δ(G)=3, then G is interval colorable and w(G)={3,if |V(G)| is even,4,if |V(G)| is odd.
We also give a negative answer to the question of Axenovich on the outerplanar triangulations.

E-mail Alert

Add your e-mail address to receive upcoming issues of Ars Combinatoria.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;