The first to (k+1)-th smallest Wiener (hyper-Wiener) indices of connected graphs

MaRDI QIDQ3652167zbMATH OpenFDO

Authors Muhuo Liu, Xuezhong Tan

Publication date 17 December 2009

zbMATH Keywords

distancehyper-Wiener index

Mathematics Subject Classification ID

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

Recommendations

• On the Wiener index of graphs
• The nine smallest hyper-Wiener indices of trees and the eight smallest hyper-Wiener (Wiener) indices of unicyclic graphs
• Ordering trees by their Wiener indices
• On Wiener and hyper-Wiener indices of graphs with fixed number of cut vertices
• Ordering trees and connected graphs by their Wiener index

This page was built for publication: The first to \((k+1)\)-th smallest Wiener (hyper-Wiener) indices of connected graphs

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