A linear algorithm for obtaining the Laplacian eigenvalues of a cograph

DOI10.1515/spma-2024-0024MaRDI QIDQ6646723

Guantao Chen, Fernando Colman Tura

Publication date: 3 December 2024

Published in: Special Matrices (Search for Journal in Brave)

zbMATH Keywords

Laplacian eigenvaluesspanning treescograph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple linear-time recognition algorithm for weakly quasi-threshold graphs
• Laplacian spectrum of weakly quasi-threshold graphs
• Complement reducible graphs
• Degree maximal graphs are Laplacian integral
• A certain polynomial of a graph and graphs with an extremal number of trees
• No threshold graphs are cospectral
• Multiplicity of eigenvalues of cographs
• Eigenvalue location in cographs
• A simple linear time algorithm for cograph recognition
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Quasi-threshold graphs
• Exploring symmetries in cographs: obtaining spectra and energies
• Integral cographs
• Integer Laplacian eigenvalues of chordal graphs
• A Simple Linear Time LexBFS Cograph Recognition Algorithm
• A Linear Recognition Algorithm for Cographs
• Graph Classes: A Survey
• Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
• Tridiagonal matrices and spectral properties of some graph classes
• Laplacian eigenvalues of equivalent cographs

This page was built for publication: A linear algorithm for obtaining the Laplacian eigenvalues of a cograph