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 number of tight extensions, generated by procedure E from a given tight digraph, is characterized. Tight digraphs for which procedure E gives infinite tight extensions are also characterized. Finally, these two procedures allow the obtention of new optimal families of --Cayley digraphs and also the improvement of the diameter of many proposals in the literature.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.