An Explicit Construction of Lower-Diameter Cubic Graphs
From MaRDI portal
Publication:4443115
DOI10.1137/S0895480197330266zbMath1029.05078OpenAlexW2027156086MaRDI QIDQ4443115
No author found.
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480197330266
Related Items (2)
An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power] ⋮ Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
This page was built for publication: An Explicit Construction of Lower-Diameter Cubic Graphs