A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
type: Item
instance of: scholarly article
title: A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
author: Guantao Chen
author: Fernando Colman Tura
published in: Special Matrices
publication date: 2024-12-03T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7952356
zbMATH Keywords: cograph
zbMATH Keywords: Laplacian eigenvalues
zbMATH Keywords: spanning trees
MaRDI profile type: MaRDI publication profile
cites work: Integer Laplacian eigenvalues of chordal graphs
cites work: Multiplicity of eigenvalues of cographs
cites work: Integral cographs
cites work: Tridiagonal matrices and spectral properties of some graph classes
cites work: Laplacian spectrum of weakly quasi-threshold graphs
cites work: Q3166466
cites work: Graph Classes: A Survey
cites work: A Simple Linear Time LexBFS Cograph Recognition Algorithm
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Algorithmic graph theory and perfect graphs
cites work: A simple linear time algorithm for cograph recognition
cites work: Eigenvalue location in cographs
cites work: Quasi-threshold graphs
cites work: Exploring symmetries in cographs: obtaining spectra and energies
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: No threshold graphs are cospectral
cites work: Laplacian eigenvalues of equivalent cographs
cites work: Threshold graphs and related topics
cites work: Degree maximal graphs are Laplacian integral
cites work: Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
cites work: Q3073568
cites work: A simple linear-time recognition algorithm for weakly quasi-threshold graphs
DOI: 10.1515/SPMA-2024-0024
description: scientific article; zbMATH DE number 7952356