Ordering trees with given matching number by their Wiener indices
From MaRDI portal
Publication:499995
DOI10.1007/S12190-014-0840-ZzbMATH Open1322.05041OpenAlexW1982506027MaRDI QIDQ499995FDOQ499995
Shangwang Tan, Ning-ning Wei, Dong-fang Wang, Qi-long Wang
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
Recommendations
- Ordering trees by their Wiener indices
- scientific article; zbMATH DE number 2185797
- Ordering trees having small reverse Wiener indices
- Ordering trees and connected graphs by their Wiener index
- On the ordering of trees by the two indices
- Ordering of trees with fixed matching number by the Laplacian coefficients
- Ordering trees with fixed order and matching number by Laplacian spectral radius
- scientific article; zbMATH DE number 5627542
- scientific article; zbMATH DE number 1890120
- Trees with a given order and matching number that have maximum general Randić index
Trees (05C05) Distance in graphs (05C12) Connectivity (05C40) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Wiener index of hexagonal systems
- Wiener index versus maximum degree in trees
- Wiener index of trees: Theory and applications
- Trees with minimal Laplacian coefficients
- Distance in graphs
- Title not available (Why is that?)
- The extremal values of the Wiener index of a tree with given degree sequence
- Trees with extremal Wiener indices
- Wiener index of graphs with more than one cut-vertex
- Average distance and independence number
- Ordering of trees with fixed matching number by the Laplacian coefficients
- The Maximum Wiener Index of Trees with Given Degree Sequences
- Ordering trees by their Wiener indices
- On the Laplacian coefficients of trees with a perfect matching
- Variation of the Wiener index under tree transformations
- Ordering trees with perfect matchings by their Wiener indices
- Title not available (Why is that?)
- The trees on \(n\geq 9\) vertices with the first to seventeenth greatest Wiener indices are chemical trees
Cited In (10)
- The minimum Wiener index of unicyclic graphs with a fixed diameter
- Variation of the Wiener index under tree transformations
- Connections between Wiener index and matchings
- The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges
- All but 49 numbers are Wiener indices of trees
- The largest Wiener index of unicyclic graphs given girth or maximum degree
- Ordering trees by their Wiener indices
This page was built for publication: Ordering trees with given matching number by their Wiener indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499995)