Spectral properties of cographs and P₅-free graphs

From MaRDI portal
Publication:4967261

DOI10.1080/03081087.2018.1466865zbMATH Open1415.05105arXiv1602.02069OpenAlexW2801741760MaRDI QIDQ4967261FDOQ4967261


Authors: E. Ghorbani Edit this on Wikidata


Publication date: 3 July 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: A cograph is a simple graph which contains no path on 4 vertices as an induced subgraph. We consider the eigenvalues of adjacency matrices of cographs and prove that a graph G is a cograph if and only if no induced subgraph of G has an eigenvalue in the interval (1,0). It is also shown that the multiplicity of any eigenvalue of a cograph G does not exceed the sum of multiplicities of 0 and 1 as eigenvalues of G. We introduce a partial order on the vertex set of graphs G in terms of inclusions among the open and closed neighborhoods of vertices, and conjecture that the multiplicity of any eigenvalue of a cograph G except for 0,1 does not exceed the maximum size of an antichain with respect to that partial order. In two extreme cases (in particular for threshold graphs), the conjecture is shown to be true. Finally, we give a simple proof for the result that bipartite P5-free graphs have no eigenvalue in the intervals (1/2,0) and (0,1/2).


Full work available at URL: https://arxiv.org/abs/1602.02069




Recommendations




Cites Work


Cited In (16)

Uses Software





This page was built for publication: Spectral properties of cographs and \(P_5\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967261)