Ordering trees with given matching number by their Wiener indices

DOI10.1007/S12190-014-0840-ZzbMath1322.05041OpenAlexW1982506027MaRDI QIDQ499995

Ning-ning Wei, Dong-fang Wang, Qi-long Wang, Shang-Wang Tan

Publication date: 7 October 2015

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

Full work available at URL: https://doi.org/10.1007/s12190-014-0840-z

zbMATH Keywords

treematchingdiameterWiener index

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (4)

The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ The minimum Wiener index of unicyclic graphs with a fixed diameter ⋮ The largest Wiener index of unicyclic graphs given girth or maximum degree ⋮ On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering of trees with fixed matching number by the Laplacian coefficients
• On the Laplacian coefficients of trees with a perfect matching
• The extremal values of the Wiener index of a tree with given degree sequence
• Trees with minimal Laplacian coefficients
• Wiener index of graphs with more than one cut-vertex
• Average distance and independence number
• Wiener index of hexagonal systems
• Wiener index versus maximum degree in trees
• Variation of the Wiener index under tree transformations
• Distance in graphs
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Wiener index of trees: Theory and applications

This page was built for publication: Ordering trees with given matching number by their Wiener indices