Abstract
A graph G=(VG,EG) is said to be a cograph if the path P4 does not appear among its induced subgraphs. The vicinal preorder ≺ on the vertex set VG is defined in terms of inclusions between neighborhoods. The minimum number ∇(G) of ≺-chains required to cover G is called the Dilworth number of G. In this paper it is proved that for a cograph G, the multiplicity of every Seidel eigenvalue λ≠±1 does not exceed ∇(G). This bound turns out to be tight and can be further improved for threshold graphs. Moreover, it is shown that cographs with at least two vertices have no Seidel eigenvalues in the interval (−1,1).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
