Laplacian coefficients of trees with given number of leaves or vertices of degree two
From MaRDI portal
Recommendations
Cites work
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Connections between Wiener index and matchings
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 5841838 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 5259335 (Why is no real title available?)
- Incidence energy of a graph
- Laplacian-like energy of trees
- Minimum energy on trees with \(k\) pendent vertices
- On incidence energy of a graph
- On incidence energy of graphs
- On Laplacian like energy of trees
- On minimal energies of non-starlike trees with given number of pendent vertices
- On the Laplacian coefficients of acyclic graphs
- On the Laplacian coefficients of unicyclic graphs
- On the minimal energy of trees with a given number of pendent vertices
- On the minimal energy of trees with a given number of vertices of degree two
- Ordering trees by the Laplacian coefficients
- Signless Laplacians of finite graphs
- Starlike trees are determined by their Laplacian spectrum
- The spectral radius of trees on \(k\) pendant vertices
- Unicyclic graphs with given number of pendent vertices and minimal energy
- Wiener index of trees: Theory and applications
Cited in
(24)- The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.
- On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with n vertices and m pendant vertices
- A note on extremal trees with degree conditions
- Extremal trees with fixed degree sequence
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- On the Laplacian coefficients of tricyclic graphs
- The coefficients of Laplacian characteristic polynomials of graphs
- Laplacian coefficients of trees with a given bipartition
- On the Laplacian coefficients of graphs under some transformations
- The signless Laplacian coefficients and incidence energy of bicyclic graphs
- Further results on the distance spectral radius of graphs
- On the coefficients of the Laplacian characteristic polynomial of trees
- Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
- Comparison between Kirchhoff index and the Laplacian-energy-like invariant
- The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices
- On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- Ordering of trees with fixed matching number by the Laplacian coefficients
- On the Laplacian coefficients of trees with a perfect matching
- When (signless) Laplacian coefficients meet matchings of subdivision
- Graphs with the minimal Laplacian coefficients
- On the Laplacian coefficients of bicyclic graphs
- On the ordering of trees by the Laplacian coefficients
- Trees with minimal Laplacian coefficients
This page was built for publication: Laplacian coefficients of trees with given number of leaves or vertices of degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734933)
