The dilating method to obtain dense Cayley digraphs on finite abelian groups

MaRDI QIDQ5000300zbMATH OpenFDO

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

Publication date 12 July 2021

Full work available at URL https://arxiv.org/abs/1611.05404, http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p217.pdf

zbMATH Keywords

minimum distance diagraminfinite family of Cayley digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite Abelian groups is presented. The method works for any given degree and it is based on consecutive dilates of a minimum distance diagram associated with a given initial Cayley digraph. The method is used to obtain infinite families of dense or asymptotically dense Cayley digraphs. In particular, for degree $d=3$, an infinite family of maximum known density is proposed.

Recommendations

• A geometric approach to dense Cayley digraphs of finite abelian groups
• Abelian Cayley digraphs with asymptotically large order for any given degree
• Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
• Large Cayley graphs on an abelian group
• Large Cayley digraphs of given degree and diameter

Cites work

• scientific article; zbMATH DE number 3401090 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Abelian Cayley digraphs with asymptotically large order for any given degree
• 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
• Extremal Problems in the Construction of Distributed Loop Networks
• Factoring in embedding dimension three numerical semigroups
• Faster algorithms for Frobenius numbers
• Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
• Lattice-Simplex Coverings and the 84-Shape
• New dense families of triple loop networks
• On Dense Triple-Loop Networks
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Triple loop networks with small transmission delay
• Triple-loop networks with arbitrarily many minimum distance diagrams
• Weighted multi-connected loop networks

Cited in

(3)

• Abelian Cayley digraphs with asymptotically large order for any given degree
• Further study on method of ``homogeneity Cayley directed digraph of finite graphs
• A geometric approach to dense Cayley digraphs of finite abelian groups

This page was built for publication: The dilating method to obtain dense Cayley digraphs on finite abelian groups

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