Laplacian coefficients of trees with a given bipartition
From MaRDI portal
Publication:2431179
DOI10.1016/j.laa.2011.01.011zbMath1226.05162OpenAlexW2000341805MaRDI QIDQ2431179
Publication date: 11 April 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.01.011
Trees (05C05) Partitions of sets (05A18) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition ⋮ The coefficients of Laplacian characteristic polynomials of graphs ⋮ On the Laplacian coefficients of graphs under some transformations ⋮ On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices ⋮ On the Laplacian coefficients of trees with a perfect matching ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the Laplacian coefficients of tricyclic graphs ⋮ On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs ⋮ Further results on the distance spectral radius of graphs
Cites Work
- 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 acyclic graphs
- Trees with minimal Laplacian coefficients
- On the Laplacian coefficients of unicyclic graphs
- Ordering trees by the Laplacian coefficients
- On acyclic conjugated molecules with minimal energies
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Laplacian coefficients of trees with a given bipartition
