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

DOI10.1007/S00493-020-3989-0zbMATH Open1488.05426OpenAlexW3163212952MaRDI QIDQ2043762FDOQ2043762

Authors: Michael Capalbo 

Publication date: 3 August 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-020-3989-0

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

zbMATH Keywords

cubic graphundirected graphdiameter of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Cites Work

• Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
• Title not available (Why is that?)
• Ramanujan graphs
• Title not available (Why is that?)
• Cubic Ramanujan graphs
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• The Diameter of a Cycle Plus a Random Matching
• An Explicit Construction of Lower-Diameter Cubic Graphs
• Automorphism groups of circulant digraphs with applications to semigroup theory
• Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power

Cited In (2)

• Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power
• The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter

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)