On Some Bi-Cayley Graphs over Cyclic Groups of Order $p^2 q^2$ and Related Extensions
Iqbal Atmaja, Yeni Susanti, and Ahmad Erfanian

TL;DR
This paper explores the structural and combinatorial properties of Bi-Cayley graphs over cyclic groups of order p^2 q^2, revealing their connectivity, girth, diameter, and extending results to broader classes of Bi-Cayley graphs.
Contribution
It provides a detailed analysis of Bi-Cayley graphs over cyclic groups of order p^2 q^2 and extends key properties to more general finite groups under specific conditions.
Findings
Bi-Cayley graphs are connected and biregular.
Girth of these graphs is three.
Diameter is exactly five.
Abstract
We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order , where and are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main focus is on analyzing their connectivity, girth, clique number, chromatic number, diameter, and independence number. It is shown that these Bi-Cayley graphs are connected, biregular with explicitly determined degrees, and possess girth three. Furthermore, we prove that their diameter is equal to five. We further extend several results to Bi-Cayley graphs over arbitrary finite groups under suitable restrictions on the connecting set, with particular emphasis on the case where the connecting set consists of all its involutions. These results clarify structural similarities and differences between Cayley graphs and their Bi-Cayley generalizations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Interconnection Networks and Systems
