Eigenvalue location in cographs
From MaRDI portal
Publication:1752501
DOI10.1016/j.dam.2017.02.007zbMath1387.05152arXiv1609.04477OpenAlexW2522271203MaRDI QIDQ1752501
Fernando Colman Tura, Vilmar Trevisan, David P. Jacobs
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04477
Related Items (11)
Eigenvalue location in graphs of small clique-width ⋮ Characterizing and computing weight-equitable partitions of graphs ⋮ Integral cographs ⋮ Laplacian eigenvalues of equivalent cographs ⋮ Generating \(I\)-eigenvalue free threshold graphs ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Distance eigenvalues of a cograph and their multiplicities ⋮ Critical ideals of signed graphs with twin vertices ⋮ Domination and Spectral Graph Theory ⋮ Cographs: eigenvalues and Dilworth number ⋮ Exploring symmetries in cographs: obtaining spectra and energies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diagonalization of generalized lollipop graphs
- On the spectrum of threshold graphs
- Eigenvalues and energy in threshold graphs
- Locating the eigenvalues of trees
- Spectra of graphs
- Some spectral properties of cographs
- On the rank of a cograph
- Complement reducible graphs
- The rank of a cograph
- A simple linear time algorithm for cograph recognition
- Eigenvalue location in threshold graphs
- On the adjacency matrix of a threshold graph
- Indices for special classes of trees
- The number of trees in a graph. I. II
- A Linear Recognition Algorithm for Cographs
This page was built for publication: Eigenvalue location in cographs