A family of graphs and the degree/diameter problem

DOI10.1002/JGT.1007zbMATH Open0991.05060OpenAlexW4254332264MaRDI QIDQ2744572FDOQ2744572

Geoffrey Exoo

Publication date: 24 August 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1007

zbMATH Keywords

diameterdegreeregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Minimal Regular Graphs of Girths Eight and Twelve

Cited In (7)

• Diameter determination on restricted graph families
• Optimal graphs in the enhanced mesh networks
• Family sizes for complete multipartite graphs
• Some new large (Δ, 3)‐graphs
• The maximum degree \& diameter-bounded subgraph and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• A note on diameter and the degree sequence of a graph 👍 👎
• An Extremal Problem of Graphs with Diameter 2 👍 👎
• A generalisation of the diameter of a graph 👍 👎
• Diameter determination on restricted graph families 👍 👎
• Title not available (Why is that?) 👍 👎
• The degree-diameter problem for outerplanar graphs 👍 👎
• Some properties of graphs of diameters 👍 👎
• Some large graphs with given degree and diameter 👍 👎
• On the metric dimension of some families of graphs 👍 👎

This page was built for publication: A family of graphs and the degree/diameter problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744572)