The \((n,n)\)-graphs with the first three extremal Wiener indices

DOI10.1007/S10910-006-9179-5zbMath1147.05303OpenAlexW2108847831MaRDI QIDQ926911

Zikai Tang, Hanyuan Deng

Publication date: 21 May 2008

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9179-5

zbMATH Keywords

distanceWiener index\((n,n)\)-graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (17)

On extremal bipartite graphs with a given connectivity ⋮ On the difference between the (revised) Szeged index and the Wiener index of cacti ⋮ On extremal cacti with respect to the revised Szeged index ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Multiplicatively weighted Harary index of graphs ⋮ Wiener indices of spiro and polyphenyl hexagonal chains ⋮ Unnamed Item ⋮ Graph distance measures based on topological indices revisited ⋮ On extremal cacti with respect to the Szeged index ⋮ The minimum Wiener index of unicyclic graphs with a fixed diameter ⋮ The largest Wiener index of unicyclic graphs given girth or maximum degree ⋮ Computation of topological indices of some graphs ⋮ Remarks on the Wiener index of unicyclic graphs ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ The second-minimum Wiener index of cacti with given cycles ⋮ Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index ⋮ The maximum hyper-Wiener index of cacti

Cites Work

• Unnamed Item
• Wiener index of hexagonal systems
• Wiener index of trees: Theory and applications

This page was built for publication: The \((n,n)\)-graphs with the first three extremal Wiener indices