Abstract
Let D be the distance matrix of a connected graph G and let n−(G),n+(G) be the numbers of strictly negative and positive eigenvalues of D respectively. It was remarked in Graham and Lovász (1978) that it is not known whether there is a graph for which n+(G)>n−(G). In this note we show that there exist an infinite number of graphs satisfying the stated inequality, namely the conference graphs of order >9, a major representative of this class being the Paley graphs. The result is obtained by deriving the eigenvalues of the distance matrix of a strongly regular graph.
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.
