Optimal extensions and quotients of 2--Cayley Digraphs

preprint2015arXivOpen access

Abstract

Given a finite Abelian group GG and a generator subset A⊂GA\subset G of cardinality two, we consider the Cayley digraph Γ=Γ=Cay(G,A)(G,A). This digraph is called 22--Cayley digraph. An extension of ΓΓ is a 22--Cayley digraph, Γ′=Γ'=Cay(G′,A)(G',A) with G<G′G<G', such that there is some subgroup H<G′H<G' satisfying the digraph isomorphism Cay(G′/H,A)≅(G'/H,A)\congCay(G,A)(G,A). We also call the digraph ΓΓ a quotient of Γ′Γ'. Notice that the generator set does not change. A 22--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 22--Cayley digraphs, respectively. These procedures are used to obtain optimal quotients and extensions. Quotients obtained by procedure Q of optimal 22--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 22--Cayley digraphs and also the improvement of the diameter of many proposals in the literature.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.