Laplacian spectrum of weakly quasi-threshold graphs

DOI10.1007/s00373-008-0785-9zbMath1226.05150MaRDI 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

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

05C07: Vertex degrees

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item