Abstract
Let be a simple connected graph. We use , , and to denote the number of negative eigenvalues, positive eigenvalues, and zero eigenvalues of the adjacency matrix of , respectively. In this paper, we prove that when is odd, and for a graph containing cycles, where and are the diameter and girth of the graph , respectively. Furthermore, we characterize the extremal graphs for the cases of , , and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.