The degree-diameter problem for circulant graphs of degrees 10 and 11
From MaRDI portal
Publication:724874
DOI10.1016/j.disc.2018.05.024zbMath1392.05027arXiv1803.07071OpenAlexW2809906755MaRDI QIDQ724874
Publication date: 26 July 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07071
Related Items
Greedy routing in circulant networks, On the non-existence of Abelian Moore Cayley graphs with excess one, Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks, Unnamed Item, Unnamed Item, The degree-diameter problem for circulant graphs of degrees 10 and 11
Cites Work
- Unnamed Item
- The degree-diameter problem for circulant graphs of degree 8 and 9
- The degree-diameter problem for circulant graphs of degrees 10 and 11
- A Combinatorial Problem Related to Multimodule Memory Organizations
- The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
- Undirected loop networks
- Note on a “Square” Functional Equation