Publication:3070726
From MaRDI portal
zbMath1299.05083MaRDI QIDQ3070726
Publication date: 26 January 2011
05C05: Trees
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
Related Items
Some graphs determined by their (signless) Laplacian spectra, Unnamed Item, Unnamed Item, Kemeny's constant and Wiener index on trees, Ordering trees with given matching number by their Wiener indices, The largest Wiener index of unicyclic graphs given girth or maximum degree, On the Laplacian coefficients of unicyclic graphs with prescribed matching number, Distance spectral radius of trees with given matching number, On the Laplacian coefficients of trees with a perfect matching, Trees with minimal Laplacian coefficients, The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices, The Kirchhoff indices and the matching numbers of unicyclic graphs, Note on extremal graphs with given matching number, The minimum Wiener index of unicyclic graphs with a fixed diameter, Wiener index of iterated line graphs of trees homeomorphic to \(H\), A note on extremal trees with degree conditions, Unicyclic graphs with extremal Lanzhou index, Degree distance of unicyclic graphs with given matching number, Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees, Ordering the non-starlike trees with large reverse wiener indices
