Abelian Cayley digraphs with asymptotically large order for any given degree
From MaRDI portal
Publication:281620
zbMath1335.05080arXiv1502.02744MaRDI QIDQ281620
Sonia Pérez, Francesc Aguiló, Miquel Àngel 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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items (4)
The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ A geometric approach to dense Cayley digraphs of finite abelian groups ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Double commutative-step digraphs with minimum diameters
- 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
- On Dense Triple-Loop Networks
- Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
- A Combinatorial Problem Related to Multimodule Memory Organizations
- 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
This page was built for publication: Abelian Cayley digraphs with asymptotically large order for any given degree