The largest Wiener index of unicyclic graphs given girth or maximum degree

DOI10.1007/s12190-015-0971-xzbMath1356.05043OpenAlexW2284129704MaRDI QIDQ513505

Yan Lin, Shang-Wang Tan

Publication date: 7 March 2017

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-015-0971-x

zbMATH Keywords

girthWiener indexunicyclic graphmaximum degree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Vertex degrees (05C07)

Related Items (4)

The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Graphs whose Wiener index does not change when a specific vertex is removed ⋮ The minimum Wiener index of unicyclic graphs with a fixed diameter ⋮ The Wiener index of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering trees with given matching number by their Wiener indices
• The \((n,n)\)-graphs with the first three extremal Wiener indices
• Wiener index of graphs with more than one cut-vertex
• Spectra of unicyclic graphs
• Wiener index versus maximum degree in trees
• Superdominance order and distance of trees with bounded maximum degree
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Wiener index of trees: Theory and applications

This page was built for publication: The largest Wiener index of unicyclic graphs given girth or maximum degree