Ordering of trees with fixed matching number by the Laplacian coefficients
DOI10.1016/J.LAA.2011.02.050zbMATH Open1221.05235OpenAlexW1976439244MaRDI QIDQ551269FDOQ551269
Authors: Shushan He, Shuchao Li 
Publication date: 15 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.02.050
Recommendations
- On the Laplacian coefficients of trees with a perfect matching
- Trees with minimal Laplacian coefficients
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- Laplacian coefficients of trees
treeLaplacian matrixincidence energymatching numberWiener indexLaplacian coefficientsLaplacian-like energy
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Signless Laplacians of finite graphs
- Title not available (Why is that?)
- On the Laplacian coefficients of unicyclic graphs
- Ordering trees by the Laplacian coefficients
- Connections between Wiener index and matchings
- A connection between ordinary and Laplacian spectra of bipartite graphs
- On incidence energy of graphs
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- On the ordering of trees by the Laplacian coefficients
- On the Laplacian coefficients of acyclic graphs
- Trees with minimal Laplacian coefficients
- A certain polynomial of a graph and graphs with an extremal number of trees
- A survey of graph laplacians
- On incidence energy of a graph
- On Laplacian like energy of trees
- On the Laplacian coefficients of bicyclic graphs
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Laplacian-like energy of trees
- On the Laplacian spectral radii of bicyclic graphs
Cited In (21)
- Laplacian coefficients of trees
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- On the ordering of trees by the Laplacian coefficients
- Laplacian coefficients of trees with a given bipartition
- Ordering trees by the Laplacian coefficients
- Trees with minimal Laplacian coefficients
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Title not available (Why is that?)
- Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
- Comparison between Kirchhoff index and the Laplacian-energy-like invariant
- On the Laplacian coefficients of tricyclic graphs with prescribed matching number
- Characterizing trees with large Laplacian energy
- When (signless) Laplacian coefficients meet matchings of subdivision
- On the Laplacian coefficients of trees with a perfect matching
- Ordering trees with given matching number by their Wiener indices
- Ordering trees and graphs with few cycles by algebraic connectivity
- Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
- On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
- On the Laplacian coefficients of graphs under some transformations
This page was built for publication: Ordering of trees with fixed matching number by the Laplacian coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551269)
