Optimal extensions and quotients of 2--Cayley Digraphs
F. Aguil\'o, A. Miralles, M. Zaragoz\'a

TL;DR
This paper introduces procedures to generate optimal extensions and quotients of 2-Cayley digraphs, leading to new optimal families and improved diameters in the context of finite Abelian groups.
Contribution
The paper defines procedures E and Q for constructing optimal extensions and quotients of 2-Cayley digraphs, and proves their properties, including optimality preservation.
Findings
Quotients obtained by procedure Q are also optimal.
Characterization of the number of tight extensions generated by procedure E.
Identification of conditions for infinite tight extensions.
Abstract
Given a finite Abelian group and a generator subset of cardinality two, we consider the Cayley digraph Cay. This digraph is called --Cayley digraph. An extension of is a --Cayley digraph, Cay with , such that there is some subgroup satisfying the digraph isomorphism CayCay. We also call the digraph a quotient of . Notice that the generator set does not change. A --Cayley digraph is called optimal when its diameter is optimal with respect to its order. In this work we define two procedures, E and Q, which generate a particular type of extensions and quotients of --Cayley digraphs, respectively. These procedures are used to obtain optimal quotients and extensions. Quotients obtained by procedure Q of optimal --Cayley digraphs are proved to be also optimal. The…
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
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Interconnection Networks and Systems
