Average distance, minimum degree, and spanning trees
From MaRDI portal
Publication:4944680
DOI<1::AID-JGT1>3.0.CO;2-L 10.1002/(SICI)1097-0118(200001)33:1<1::AID-JGT1>3.0.CO;2-LzbMath0939.05030OpenAlexW4244712399WikidataQ105989590 ScholiaQ105989590MaRDI QIDQ4944680
Roger Entringer, Peter Dankelmann
Publication date: 29 June 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200001)33:1<1::aid-jgt1>3.0.co;2-l
Related Items
Wiener index in graphs with given minimum degree and maximum degree ⋮ The maximum Wiener index of maximal planar graphs ⋮ The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees ⋮ On the extremal properties of the average eccentricity ⋮ A new bound of radius with irregularity index ⋮ Relationships between some distance-based topological indices ⋮ On mean distance and girth ⋮ The Steiner diameter of a graph with prescribed girth ⋮ The average eccentricity of a graph with prescribed girth ⋮ The extremal average distance of cubic graphs ⋮ On eccentric distance sum and minimum degree ⋮ Average distance, minimum degree, and irregularity index ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ 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 ⋮ Unnamed Item ⋮ Upper bounds on the Steiner diameter of a graph ⋮ Wiener index of quadrangulation graphs ⋮ Average distance in weighted graphs ⋮ Spanning trees: A survey ⋮ A note on diameter and the degree sequence of a graph ⋮ Total distance, Wiener index and opportunity index in wreath products of star graphs ⋮ Diameter and inverse degree ⋮ Average distance in colored graphs ⋮ DEGREE DISTANCE AND MINIMUM DEGREE ⋮ Average distance and generalised packing in graphs ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Average eccentricity, minimum degree and maximum degree in graphs ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Proof of a conjecture on the Wiener index of Eulerian graphs ⋮ Nordhaus-Gaddum Type results for the Harary index of graphs ⋮ Comparative study of distance-based graph invariants ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Average distance and vertex-connectivity ⋮ Average Distance, Independence Number, and Spanning Trees ⋮ Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs ⋮ Proximity, remoteness and minimum degree
Cites Work
- Mean distance in a graph
- Radius, diameter, and minimum degree
- Average distance and independence number
- Computing the average distance of an interval graph
- On the sum of all distances in composite graphs
- On the average Steiner distance of graphs with presribed properties
- Average distance and domination number
- On the sum of all distances in a graph or digraph
- The complexity of the network design problem
- Mean distance and minimum degree
- The average Steiner distance of a graph
