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

zbMATH Open1468.05105arXiv1611.05404MaRDI QIDQ5000300FDOQ5000300

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

Publication date: 12 July 2021

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.

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

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

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)

Cites Work

• New dense families of triple loop networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Extremal Problems in the Construction of Distributed Loop Networks
• 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
• 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
• Abelian Cayley digraphs with asymptotically large order for any given degree
• On Dense Triple-Loop Networks
• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
• Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Title not available (Why is that?)
• Factoring in embedding dimension three numerical semigroups
• Double commutative-step digraphs with minimum diameters
• Faster algorithms for Frobenius numbers
• Lattice-Simplex Coverings and the 84-Shape

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)