A sharp lower bound for the Wiener index of a graph.

zbMATH Open1247.92059MaRDI QIDQ3115014FDOQ3115014

Authors

Publication date 20 February 2012

Full work available at URL https://arxiv.org/abs/1008.4039

zbMATH Keywords

diameterWiener indexmolecular graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound. We obtain a sharp lower bound for W(G) of an arbitrary graph in terms of the order, size and diameter of G.

Recommendations

• scientific article; zbMATH DE number 2121253
• Estimating the Wiener index by means of number of vertices, number of edges, and diameter
• Wiener index of line graphs
• A note on Wiener index
• scientific article; zbMATH DE number 5619543

Cited in

(6)

• Estimating the Wiener index by means of number of vertices, number of edges, and diameter
• Wiener index of the tensor product of cycles
• A note on Wiener index
• scientific article; zbMATH DE number 2121253 (Why is no real title available?)
• scientific article; zbMATH DE number 6750341 (Why is no real title available?)
• The Wiener lower sum and upper sum of friendship graph \(F^r_n\)

This page was built for publication: A sharp lower bound for the Wiener index of a graph.

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