The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices

DOI10.1007/s12190-016-1022-yzbMath1373.05056OpenAlexW2460154164MaRDI QIDQ1677116

Qi-long Wang, Yan Lin, Shang-Wang Tan

Publication date: 10 November 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-016-1022-y

zbMATH Keywords

Wiener indexunicyclic graphpendant vertexcut vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items

Wiener index of graphs with fixed number of pendant or cut-vertices ⋮ The minimum Wiener index of unicyclic graphs with a fixed diameter ⋮ The Wiener index of hypergraphs

Cites Work

• Ordering trees with given matching number by their Wiener indices
• The largest Wiener index of unicyclic graphs given girth or maximum degree
• The \((n,n)\)-graphs with the first three extremal Wiener indices
• Wiener index of graphs with more than one cut-vertex
• Average distance and independence number
• Average distance and domination number
• Wiener index versus maximum degree in trees
• Superdominance order and distance of trees with bounded maximum degree
• Remarks on the Wiener index of unicyclic graphs
• The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
• ON DISTANCES IN CHROMATIC GRAPHS
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item