A generalisation of the diameter of a graph

DOI10.1016/0012-365X(91)90153-SMaRDI QIDQ1179271zbMATH OpenOpenAlexFDO

Authors Douglas D. Grant

Publication date 26 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(91)90153-s

zbMATH Keywords

connected graphdiameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (05C99)

Recommendations

• Eigenvalues and diameter
• Sharp Bounds on the Diameter of a Graph
• Radius, diameter, and minimum degree
• Upper bounds on the Steiner diameter of a graph
• scientific article; zbMATH DE number 1472184

Cited in

(11)

• scientific article; zbMATH DE number 4057547 (Why is no real title available?)
• Edge-wide-diameter of graphs with diameter d
• A family of graphs and the degree/diameter problem
• scientific article; zbMATH DE number 5119227 (Why is no real title available?)
• The diameter of Hanoi graphs
• On generalized wide diameter of graphs.
• DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH
• The Diameter of a Graph and its Complement
• Some diameter notions of the generalized Mycielskian of a graph
• Packing constants in graphs and connectivity
• Diameter-invariant graphs

This page was built for publication: A generalisation of the diameter of a graph

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