Ordering trees by the Laplacian coefficients

DOI10.1016/J.LAA.2009.04.018MaRDI QIDQ1039751zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

diameterLaplacian coefficientLaplacian matrixmatchingtree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

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

• 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
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• 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

(26)

• Ordinal properties of tree distances
• On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with n vertices and m pendant vertices
• Ordering trees by the spectral radius of Laplacian
• On a poset of trees revisited
• Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
• Ordering trees and graphs with few cycles by algebraic connectivity
• On the Laplacian coefficients of tricyclic 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
• Ordering trees by their Laplacian spectral radii
• Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
• Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
• scientific article; zbMATH DE number 5525812 (Why is no real title available?)
• Comparison between Kirchhoff index and the Laplacian-energy-like invariant
• On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs
• A Good Leaf Order on Simplicial Trees
• 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
• Laplacian coefficients of trees with given number of leaves or vertices of degree two
• On the ordering of trees by the Laplacian coefficients
• Trees with minimal Laplacian coefficients

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)