scientific article
From MaRDI portal
Publication:3070726
zbMath1299.05083MaRDI QIDQ3070726
Publication date: 26 January 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (20)
Ordering the non-starlike trees with large reverse wiener indices ⋮ Degree distance of unicyclic graphs with given matching number ⋮ Distance spectral radius of trees with given matching number ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Kemeny's constant and Wiener index on trees ⋮ Wiener index of iterated line graphs of trees homeomorphic to \(H\) ⋮ On the Laplacian coefficients of trees with a perfect matching ⋮ Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees ⋮ The Kirchhoff indices and the matching numbers of unicyclic graphs ⋮ Note on extremal graphs with given matching number ⋮ Ordering trees with given matching number by their Wiener indices ⋮ 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 Laplacian coefficients of unicyclic graphs with prescribed matching number ⋮ A note on extremal trees with degree conditions ⋮ Trees with minimal Laplacian coefficients ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unicyclic graphs with extremal Lanzhou index
This page was built for publication:
