Ars Combinatoria

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

Ars Combinatoria is the oldest Canadian journal of combinatorics, established in 1976, dedicated to advancing combinatorial mathematics through the publication of high-quality, peer-reviewed research papers. Over the decades, it has built a strong international reputation and continues to serve as a leading platform for significant contributions to the field.
Open Access:  The journal follows the Diamond Open Access model—completely free for both authors and readers, with no article processing charges (APCs). 
Publication Frequency: From 2024 onward, Ars Combinatoria publishes four issues annually—in March, June, September, and December.
Scope: Publishes research in all areas of combinatorics, including graph theory, design theory, enumeration, algebraic combinatorics, combinatorial optimization and related fields.
Indexing & Abstracting:  Indexed in MathSciNet, Zentralblatt MATH, and EBSCO, ensuring wide visibility and scholarly reach.
Rapid Publication: Submissions are processed efficiently, with accepted papers published promptly in the next available issue.
Print & Online Editions: Issues are available in both print and online formats to serve a broad readership.

Ajay K.Sharma1, Sei-Ichiro Ueki2
1SCHOOL OF MATHEMATICS, SHRI MATA VAISHNO DEVI UNIVERSITY, KAKRYAL, KATRA- 182320, J&K, INDIA.
2Facutty OF ENGINEERING, IBARAKI UNIVERSITY, HITACHI 316 – 8511, JAPAN
Abstract:

In this paper, we characterize boundedness and compactness of products of composition operators induced by the lens and the lunar maps and iterated differentiation acting between Hardy and weighted Bergman spaces of the unit disk in terms of the angle of contact of these maps with the unit circle.

Yunshu Gao1, Guojun Li2, Jin Yan 2
1School of Mathematics, Ningxia University Yinchuan, 750021, P. R. China
2School of Mathematics, Shandong University Jinan, 250100, P. R. China
Abstract:

Let \(G = (V(G), E(G))\) be a graph and \(\alpha(G)\) be the independence number of \(G\). For a vertex \(v \in V(G)\), \(d(v)\) and \(N(v)\) represent the degree and the neighborhood of \(v\) in \(G\), respectively.In this paper, we prove that if \(G\) is a \(k\)-connected graph of order \(n\), where (\(k \geq 2\)) graph of order \(n\) and \(\max\{d(v) : v \in S\} \geq \frac{n}{2}\) for every independent set \(S\) of \(G\) with \(|S| = k\) which has two distinct vertices \(x, y \in S\) satisfying \(1\leq |N(x) \cap N(y)| \leq \alpha(G) – 2,\)
then either \(G\) is hamiltonian or else \(G\) belongs to one of a family of exceptional graphs.We also establish a similar sufficient condition for Hamiltonian-connected graphs.

Andrzej Wioch1, Malgorzata Wolowiec-Musial1
1Rzeszéw University of Technology Faculty of Mathematics and Applied Physics al. Powstaricéw Warszawy 12, 35-359 Rzeszéw, Poland
Abstract:

In this paper, we generalize the companion Pell sequence. We provide combinatorial, graph, and matrix representations of this sequence.Using these representations, we describe some properties of the generalized Pell numbers and the generalized companion Pell numbers. We define the golden Pell matrix for determining the generalized Pell sequences and, among other results, prove the “generalized Cassini formula” for them.Moreover, we establish some relations between generalized Pell numbers and the classical Fibonacci numbers.

Min-Jen Jou1
1 Ling Tung University, Taichung 40852, Taiwan
Abstract:

In this paper, we determine the third largest and the fourth largest numbers of independent sets among all trees of order \(n\). Moreover, we determine the \(k\)-th largest numbers of independent sets among all forests of order \(n\), where \(k \geq 2\). Besides, we characterize those extremal graphs achieving these values.

Yeh-Jong Pan1, Chien-Tai Ting2
1DEPARTMENT OF COMPUTER SCIENCE AND INFORMATION ENGINEERING, TAJEN UNI- versiTy, PINGTUNG 907, Tatwan, R.O.C
2DEPARTMENT OF APPLIED MATHEMATICS, NATIONAL UNIVERSITY OF KAOHSIUNG, KAousluNG 811, Tatwan, ROC. AnD DEPARTMENT OF MATHEMATICS AND Pitysics, Ain Force ACADEMY, KAOHSIUNG 820, Taiwan, ROC.
Abstract:

For a set \(\mathcal{P}\) of permutations, the sign-imbalance of \(\mathcal{P}\) is the difference between the numbers of even and odd permutations in \(\mathcal{P}\).In this paper, we determine the sign-imbalances of two classes of alternating permutations ,one is the Alternating permutations avoiding a pattern of length three and the other is the Alternating permutations of genus \(0\)
The sign-imbalance of the former involves Catalan and Fine numbers, and that of the latter is always \(\pm 1\).Meanwhile, we give a simpler proof of Dulucq and Simion’s result on the number of alternating permutations of genus \(0\).

Zbigniew R.Bogdanowicz1
1Armament Research, Development and Engineering Center Picatinny, New Jersey 07806, U.S.A.
Abstract:

A survivable path \((W, P)\) between a pair of vertices \(x_i, x_j\) in an undirected simple graph \(G\) is an ordered pair of edge-disjoint simple paths consisting of a working path \(W = x_i, \ldots, x_j\) a protection path \(P = x_i, \ldots, x_j\).An optimal set of survivable paths in graph \(G\) corresponds to a set of mesh-restored lightpaths defined on an optical network that minimizes the number of used optical channels.In this paper, we present new properties of the working paths, which are contained in an optimal set of survivable paths in \(G\).

Isaniye Ergin1, Ramazan Karatas1
1Akdeniz University, Education Faculty, 07058 Konyaalti, Antalya, TURKIYE
Abstract:

We describe the global behavior of the nonnegative equilibrium points of the difference equation

\[x_{n+1} = \frac{ax_{n -p}}{b+c \prod\limits_{i=0}^{k} x_{n-(2i+1)}},n=0,1,\ldots,\]

where \(k,p \in \mathbb{N}\), parameters \(a,b,c\) and initial conditions are nonnegative real numbers.

Ruifang Liu1, Huicai Jia2, Jinjiang Yuan1
1Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450001, China
2Department of Mathematical and Physical Sciences, Henan Institute of Engineering, Zhengzhou, Henan 451191, China
Abstract:

Let \(\mathcal{T}_{n,n-4}\) be the set of trees on \(n\) vertices with diameter \(n-4\). In this paper, we determine the unique tree which has the minimal Laplacian spectral radius among all trees in \(\mathcal{T}_{n,n-4}\).
This work is related to that of Yuan [The minimal spectral radius of graphs of order n with diameter \(n – 4\), Linear Algebra Appl. \(428(2008)2840-2851]\), which determined the graph with minimal spectral radius among all the graphs of order \(n\) with diameter \(n-4\). We can observe that the extremal tree on the Laplacian spectral radius is different from that on the spectral radius.

M. Akram1, N.O. Alshehri2, H.A. Abujabal2
1 Punjab University College of Information Technology, University of the Punjab, Old Campus, Lahore-54000, Pakistan.
2Department of Mathematics, Faculty of Sciences(Girls) King Abdulaziz University, Jeddah, Saudi Arabia
Abstract:

We introduce the notion of vague Lie sub-superalgebras (resp. vague ideals) and present some of their properties. We investigate the properties of vague Lie sub-superalgebras and vague ideals under homomorphisms of Lie superalgebras.We introduce the concept of vague bracket product and establish its characterizations. We also introduce the notions of solvable vague ideals and nilpotent vague ideals of Lie superalgebras and present the corresponding theorems parallel to Lie superalgebras.

Jianping Li1,2, Bo Zhou2
1Faculty of Applied Mathematics, Guangdong University of Technology, Guangzhou 510090, P, R. China
2Department of Mathematics, South China Normal University, Guangzhou 510631, P. R. China
Abstract:

The atom-bond connectivity (ABC) index of a graph \(G\) is defined in mathematical chemistry as\(\mathrm{ABC}(G) = \sum_{uv \in E(G)} \sqrt{\frac{d_u +d_v-2}{ d_u d_v}},\) where \(E(G)\) is the edge set of \(G\) and \(d_u\) is the degree of vertex \(u\) in \(G\).In this paper, we determine the unique graphs with the largest and the second largest ABC indices, respectively, in the class of unicyclic graphs on \(2m\) vertices with perfect matchings.