An explicit infinite family of M-vertex graphs with maximum degree K and diameter [1+o(1)]_K-1M for each K-1 a prime power
From MaRDI portal
Publication:2043762
Recommendations
- Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power
- An Explicit Construction of Lower-Diameter Cubic Graphs
- A note on large graphs of diameter two and given maximum degree
- Some large graphs with given degree and diameter
- Maximal cubic graphs with diameter 4
Cites work
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- An Explicit Construction of Lower-Diameter Cubic Graphs
- Automorphism groups of circulant digraphs with applications to semigroup theory
- Cubic Ramanujan graphs
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- The Diameter of a Cycle Plus a Random Matching
Cited in
(2)
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043762)
