Note: An Upper Bound for the Diameter of a Graph

DOI10.1137/S0895480195282471MaRDI QIDQ4699167zbMATH OpenOpenAlexFDO

Authors Russell Merris

Publication date 23 November 1999

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480195282471

zbMATH Keywords

diametereigenvaluesLaplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Eigenvalues and diameter
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Eigenvalues, diameter, and mean distance in graphs
• The diameter and Laplacian eigenvalues of directed graphs
• On the spectrum, the growth, and the diameter of a graph

Cited in

(4)

• Upper bounds for the diameter and height of graphs of convex polyhedra
• scientific article; zbMATH DE number 4132195 (Why is no real title available?)
• An upper bound on the number of edges of a hypergraph with a given diameter
• A lower bound on the diameter of the flip graph

This page was built for publication: Note: An Upper Bound for the Diameter of a Graph

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