Ordering trees by the Laplacian coefficients
From MaRDI portal
Publication:1039751
DOI10.1016/J.LAA.2009.04.018zbMATH Open1175.05091OpenAlexW1982483355MaRDI QIDQ1039751FDOQ1039751
Authors: Xia-Ping Lv, Ya-Hong Chen, Xiao-Dong Zhang 
Publication date: 23 November 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.04.018
Recommendations
- On the ordering of trees by the Laplacian coefficients
- Ordering trees by the spectral radius of Laplacian
- Ordering trees by their Laplacian spectral radii
- Ordering trees with \(n\)-vertices and diameter \(d\) by their largest Laplacian eigenvalues
- Ordering of trees with fixed matching number by the Laplacian coefficients
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Title not available (Why is that?)
- On the Laplacian coefficients of unicyclic graphs
- Laplacian matrices of graphs: A survey
- Connections between Wiener index and matchings
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Wiener index of trees: Theory and applications
- On the Laplacian coefficients of acyclic graphs
- Recent results in the theory of graph spectra
- On the Laplacian spectral radius of a tree.
- Laplace eigenvalues of graphs---a survey
- Old and new results on algebraic connectivity of graphs
- Eigenvalues, diameter, and mean distance in graphs
- A survey of graph laplacians
- Ordering trees by their Wiener indices
- Ordering trees by algebraic connectivity
- Ordering trees with algebraic connectivity and diameter
Cited In (24)
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- A Good Leaf Order on Simplicial Trees
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs
- On the ordering of trees by the Laplacian coefficients
- Ordering of trees with fixed matching number by the Laplacian coefficients
- Laplacian coefficients of trees with a given bipartition
- Ordering trees by their Laplacian spectral radii
- Trees with minimal Laplacian coefficients
- Title not available (Why is that?)
- On the Laplacian coefficients of bicyclic graphs
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
- Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
- The signless Laplacian coefficients and incidence energy of bicyclic graphs
- Ordinal properties of tree distances
- Comparison between Kirchhoff index and the Laplacian-energy-like invariant
- On a poset of trees revisited
- When (signless) Laplacian coefficients meet matchings of subdivision
- On the Laplacian coefficients of tricyclic graphs
- On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices
- On the Laplacian coefficients of trees with a perfect matching
- Ordering trees and graphs with few cycles by algebraic connectivity
- On the Laplacian coefficients of graphs under some transformations
This page was built for publication: Ordering trees by the Laplacian coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039751)
