Spectral properties of cographs andP5-free graphs
From MaRDI portal
Publication:4967261
DOI10.1080/03081087.2018.1466865zbMath1415.05105arXiv1602.02069OpenAlexW2801741760MaRDI QIDQ4967261
Publication date: 3 July 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.02069
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items (7)
Characterizing and computing weight-equitable partitions of graphs ⋮ Almost controllable graphs and beyond ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Distance eigenvalues of a cograph and their multiplicities ⋮ Eigenvalue-free interval for threshold graphs ⋮ Gap sets for the spectra of regular graphs with minimum spectral gap ⋮ Eigenvalue-free intervals of distance matrices of threshold and chain graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
- Eigenvalues and energy in threshold graphs
- Spectra of graphs
- On maximum independent sets in \(P_{5}\)-free graphs
- Some spectral properties of cographs
- On the rank of a cograph
- On certain eigenspaces of cographs
- Complement reducible graphs
- Dominating cliques in \(P_ 5\)-free graphs
- On a class of posets and the corresponding comparability graphs
- Dominating subgraphs in graphs with some forbidden structures
- A time-optimal solution for the path cover problem on cographs.
- The rank of a cograph
- Threshold graphs and related topics
- Cographs: eigenvalues and Dilworth number
- Domination, coloring and stability in \(P_5\)-reducible graphs
- Eigenvalue location in threshold graphs
- On a property of the class of n-colorable graphs
- Dacey Graphs
- Graph Classes: A Survey
- On $3$-Colorable $P_5$-Free Graphs
- Transitiv orientierbare Graphen
This page was built for publication: Spectral properties of cographs andP5-free graphs