Mean distance and minimum degree
From MaRDI portal
Publication:4337509
DOI<95::AID-JGT7>3.0.CO;2-D 10.1002/(SICI)1097-0118(199705)25:1<95::AID-JGT7>3.0.CO;2-DzbMath0872.05011OpenAlexW4237088952MaRDI QIDQ4337509
Mekkia Kouider, Peter M. Winkler
Publication date: 7 October 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199705)25:1<95::aid-jgt7>3.0.co;2-d
Related Items (24)
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 ⋮ A new bound of radius with irregularity index ⋮ Average distance, minimum degree, and spanning trees ⋮ On mean distance and girth ⋮ Minimum degree, edge-connectivity and radius ⋮ Continuous mean distance of a weighted graph ⋮ The extremal average distance of cubic graphs ⋮ On eccentric distance sum and minimum degree ⋮ Average distance, minimum degree, and irregularity index ⋮ Average distance and connected domination ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ Upper bounds on the Steiner diameter of a graph ⋮ Wiener index of quadrangulation graphs ⋮ Diameter and inverse degree ⋮ Average distance in colored graphs ⋮ DEGREE DISTANCE AND MINIMUM DEGREE ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Proof of a conjecture on the Wiener index of Eulerian graphs ⋮ Vertex degrees and doubly stochastic graph matrices ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Average Distance, Independence Number, and Spanning Trees
This page was built for publication: Mean distance and minimum degree
