Using minimum degree to bound average distance

DOI10.1016/S0012-365X(00)00156-4zbMath0959.05038OpenAlexW2079527110MaRDI QIDQ1841923

B. A. Smith, J. E. Riegsecker, Robert A. Beezer

Publication date: 20 April 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00156-4

zbMATH Keywords

minimum degreeaverage distanceGraffiti

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (17)

Wiener index in graphs with given minimum degree and maximum degree ⋮ A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH ⋮ The maximum Wiener index of maximal planar graphs ⋮ On mean distance and girth ⋮ Minimum degree, edge-connectivity and radius ⋮ The extremal average distance of cubic graphs ⋮ On eccentric distance sum and minimum degree ⋮ Average distance, minimum degree, and irregularity index ⋮ Some tight bounds for the harmonic index and the variation of the Randić index of graphs ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ Wiener index of quadrangulation graphs ⋮ Diameter and inverse degree ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Proof of a conjecture on the Wiener index of Eulerian graphs ⋮ Average distances and distance domination numbers ⋮ On the Randić index of graphs ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations

This page was built for publication: Using minimum degree to bound average distance