Abelian Cayley digraphs with asymptotically large order for any given degree

MaRDI QIDQ281620zbMATH OpenFDO

Authors Francesc Aguiló, Sonia Pérez, Miquel Angel Fiol

Publication date 11 May 2016

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.02744, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p19

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

abelian groupCayley digraphcongruences in \(\mathbb Z^n\)degree/diameter problemSmith normal form

Mathematics Subject Classification ID

Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: Abelian Cayley digraphs can be constructed by using a generalization to $Z^n$ of the concept of congruence in $Z$. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases. Up to now, the best known asymptotically dense results were all non-constructive.

Review text

Summary: Abelian Cayley digraphs can be constructed by using a generalization to \(\mathbb{Z}^n\) of the concept of congruence in \(\mathbb{Z}\). Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases. Up to now, the best known large dense results were all non-constructive.

Recommendations

• A geometric approach to dense Cayley digraphs of finite abelian groups
• Large Cayley digraphs of given degree and diameter
• Large butterfly Cayley graphs and digraphs
• The dilating method to obtain dense Cayley digraphs on finite abelian groups
• Large Cayley digraphs and bipartite Cayley digraphs of odd diameters

Cites work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
• Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
• Double commutative-step digraphs with minimum diameters
• Exact order of subsets of asymptotic bases
• Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
• scientific article; zbMATH DE number 3966106 (Why is no real title available?)
• scientific article; zbMATH DE number 3401090 (Why is no real title available?)
• New dense families of triple loop networks
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• On Dense Triple-Loop Networks
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Triple loop networks with small transmission delay
• Weighted multi-connected loop networks

Cited in

(6)

• New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
• The dilating method to obtain dense Cayley digraphs on finite abelian groups
• A geometric approach to dense Cayley digraphs of finite abelian groups
• Large Cayley digraphs of given degree and diameter from sharply t-transitive groups
• Random Cayley digraphs of diameter 2 and given degree
• An improved Moore bound and some new optimal families of mixed abelian Cayley graphs

This page was built for publication: Abelian Cayley digraphs with asymptotically large order for any given degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281620)