The Dilating Method for Cayley digraphs on finite Abelian groups

zbMath1468.05105arXiv1611.05404MaRDI QIDQ5000300

Sonia Pérez, Francesc Aguiló, Miquel Àngel Fiol

Publication date: 12 July 2021

Full work available at URL: https://arxiv.org/abs/1611.05404

zbMATH Keywords

minimum distance diagraminfinite family of Cayley digraphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Abelian Cayley digraphs with asymptotically large order for any given degree
• Factoring in embedding dimension three numerical semigroups
• Double commutative-step digraphs with minimum diameters
• Triple-loop networks with arbitrarily many minimum distance diagrams
• Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
• Exact order of subsets of asymptotic bases
• New dense families of triple loop networks
• Triple loop networks with small transmission delay
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• Weighted multi-connected loop networks
• Faster algorithms for Frobenius numbers
• On Dense Triple-Loop Networks
• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Extremal Problems in the Construction of Distributed Loop Networks
• Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
• Lattice-Simplex Coverings and the 84-Shape
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case

This page was built for publication: The Dilating Method for Cayley digraphs on finite Abelian groups