Abstract
A cograph is a graph with no induced path on four vertices. The vicinal preorder on the vertex set of a graph is defined in terms of inclusions among the neighborhoods of vertices. The minimum number of chains with respect to the vicinal preorder required to cover the vertex set of a graph G is called the Dilworth number of G. In this paper, we prove that for a connected cograph G, the multiplicity of any distance eigenvalue except −2 and −1 is at most the Dilworth number of G. Furthermore, we show that no connected cographs have distance eigenvalues in the interval (−2,−1), which generalizes a result of Lu et al. (2018) [24].
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.
