Ordering of trees with fixed matching number by the Laplacian coefficients
From MaRDI portal
(Redirected from Publication:551269)
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
Cites work
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- A certain polynomial of a graph and graphs with an extremal number of trees
- A connection between ordinary and Laplacian spectra of bipartite graphs
- A survey of graph laplacians
- Connections between Wiener index and matchings
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Laplacian-like energy of trees
- On Laplacian like energy of trees
- On incidence energy of a graph
- On incidence energy of graphs
- On the Laplacian coefficients of acyclic graphs
- On the Laplacian coefficients of bicyclic graphs
- On the Laplacian coefficients of unicyclic graphs
- On the Laplacian spectral radii of bicyclic graphs
- On the ordering of trees by the Laplacian coefficients
- Ordering trees by the Laplacian coefficients
- Signless Laplacians of finite graphs
- Trees with minimal Laplacian coefficients
- Wiener index of trees: Theory and applications
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
- On the ordering of trees by the Laplacian coefficients
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- 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
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- scientific article; zbMATH DE number 6262845 (Why is no real title available?)
- 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
- On the Laplacian coefficients of trees with a perfect matching
- When (signless) Laplacian coefficients meet matchings of subdivision
- Ordering trees with given matching number by their Wiener indices
- Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues
- Ordering trees and graphs with few cycles by algebraic connectivity
- 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)