Average Distance, Independence Number, and Spanning Trees

DOI10.1002/jgt.21758zbMath1296.05049OpenAlexW1553420780MaRDI QIDQ5495880

Simon Mukwembi

Publication date: 7 August 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21758

zbMATH Keywords

independence numberspanning treesaverage distance

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items

Wiener index in graphs with given minimum degree and maximum degree ⋮ An asymptotic relation between the wirelength of an embedding and the Wiener index ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ The extremal average distance of cubic graphs ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ Partition distance in graphs ⋮ Upper bounds on the average eccentricity ⋮ Improved bounds on the difference between the Szeged index and the Wiener index of graphs

Uses Software

• GRAFFITI

Cites Work

• Mean distance in a graph
• Average distance and independence number
• On the sum of all distances in a graph or digraph
• The average distance and the independence number
• Distance in graphs
• Mean distance and minimum degree
• Average distance, minimum degree, and spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item