On the Laplacian coefficients of acyclic graphs
From MaRDI portal
Publication:875026
DOI10.1016/j.laa.2006.12.005zbMath1120.05055OpenAlexW2016625692MaRDI QIDQ875026
Publication date: 10 April 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.12.005
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (33)
Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree ⋮ On the Laplacian coefficients of tricyclic graphs with prescribed matching number ⋮ Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees ⋮ Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number ⋮ The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices ⋮ The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition ⋮ On the distribution of Laplacian eigenvalues of trees ⋮ Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Laplacian coefficients of trees with a given bipartition ⋮ On the signless Laplacian coefficients of unicyclic graphs ⋮ On the Laplacian coefficients of graphs under some transformations ⋮ The signless Laplacian coefficients and incidence energy of bicyclic graphs ⋮ On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices ⋮ Some results on signless Laplacian coefficients of graphs ⋮ The signless Laplacian coefficients and the incidence energy of the graphs without even cycles ⋮ The minimum spectral radius of signless Laplacian of graphs with a given clique number ⋮ On the Laplacian coefficients of trees with a perfect matching ⋮ Most Laplacian eigenvalues of a tree are small ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the Laplacian coefficients of unicyclic graphs with prescribed matching number ⋮ On the Laplacian coefficients of tricyclic graphs ⋮ Ordering of trees with fixed matching number by the Laplacian coefficients ⋮ Asymptotic normality of Laplacian coefficients of graphs ⋮ On the Laplacian coefficients of bicyclic graphs ⋮ Trees with minimal Laplacian coefficients ⋮ On the Laplacian coefficients and Laplacian-like energy 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 ⋮ On the Laplacian coefficients of unicyclic graphs ⋮ Ordering trees by the Laplacian coefficients ⋮ On a Poset of Trees II ⋮ On the Laplacian coefficients of signed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connections between Wiener index and matchings
- Almost all trees share a complete set of immanantal polynomials
- On the coefficients of the Laplacian characteristic polynomial of trees
- A connection between ordinary and Laplacian spectra of bipartite graphs
- A survey of graph laplacians
- Wiener index of trees: Theory and applications
This page was built for publication: On the Laplacian coefficients of acyclic graphs
