Laplacian spectrum of weakly quasi-threshold graphs

DOI10.1007/s00373-008-0785-9zbMath1226.05150OpenAlexW2123880758MaRDI QIDQ1014809

Sukanta Pati, Ravindra B. Bapat, Arbind Kumar Lal

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0785-9

zbMATH Keywords

comparability graphs of a forest

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex degrees (05C07)

Related Items

Counting spanning trees using modular decomposition ⋮ Q-integral unicyclic, bicyclic and tricyclic graphs ⋮ A simple linear-time recognition algorithm for weakly quasi-threshold graphs ⋮ Integer Laplacian eigenvalues of chordal graphs ⋮ The Grone-Merris Conjecture ⋮ Monotonicity and expansion of global secure sets ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ On characterizations for subclasses of directed co-graphs ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ On the Laplacian integral tricyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion of Laplacian integral graphs via edge addition
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Laplacian matrices of graphs: A survey
• Degree maximal graphs are Laplacian integral
• A certain polynomial of a graph and graphs with an extremal number of trees
• Quasi-threshold graphs
• Shifted simplicial complexes are Laplacian integral
• A Linear Recognition Algorithm for Cographs
• Graph Classes: A Survey
• The Laplacian Spectrum of a Graph II
• A Note on "The Comparability Graph of a Tree"
• Inequalities: theory of majorization and its applications