Ordering trees by the Laplacian coefficients
From MaRDI portal
(Redirected from Publication:1039751)
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
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- A connection between ordinary and Laplacian spectra of bipartite graphs
- A survey of graph laplacians
- Connections between Wiener index and matchings
- Eigenvalues, diameter, and mean distance in graphs
- Laplace eigenvalues of graphs---a survey
- Laplacian matrices of graphs: A survey
- Old and new results on algebraic connectivity of graphs
- On the Laplacian coefficients of acyclic graphs
- On the Laplacian coefficients of unicyclic graphs
- On the Laplacian spectral radius of a tree.
- Ordering trees by algebraic connectivity
- Ordering trees by their Wiener indices
- Ordering trees with algebraic connectivity and diameter
- Recent results in the theory of graph spectra
- Wiener index of trees: Theory and applications
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
- Trees with minimal Laplacian coefficients
- On the Laplacian coefficients of bicyclic graphs
- Ordering trees by their Laplacian spectral radii
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- scientific article; zbMATH DE number 5525812 (Why is no real title available?)
- 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
- On the Laplacian coefficients of tricyclic graphs
- On the Laplacian coefficients of trees with a perfect matching
- On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices
- When (signless) Laplacian coefficients meet matchings of subdivision
- 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)