The coefficients of Laplacian characteristic polynomials of graphs

DOI10.1016/j.laa.2011.12.020zbMath1238.05098OpenAlexW2002320373MaRDI QIDQ2427934

Weigen Yan, Wei Qiu

Publication date: 19 April 2012

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.12.020

zbMATH Keywords

connectivitychromatic numberedge-connectivityLaplacian coefficient

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (4)

The Kirchhoff index of some combinatorial networks ⋮ Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index ⋮ Maximal energy of subdivisions of graphs with a fixed chromatic number

Cites Work

• Laplacian coefficients of trees with given number of leaves or vertices of degree two
• Trees with minimal Laplacian coefficients
• On the Laplacian coefficients of unicyclic graphs
• Laplacian graph eigenvectors
• Laplacian coefficients of trees with a given bipartition
• A connection between ordinary and Laplacian spectra of bipartite graphs
• The number of spanning trees of a graph
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The coefficients of Laplacian characteristic polynomials of graphs