The relationship between the negative inertia index of graph GG and its girth gg and diameter dd

preprint2024arXivOpen access

Abstract

Let GG be a simple connected graph. We use n(G)n(G), p(G)p(G), and η(G)η(G) to denote the number of negative eigenvalues, positive eigenvalues, and zero eigenvalues of the adjacency matrix A(G)A(G) of GG, respectively. In this paper, we prove that 2n(G)≥d(G)+12n(G)\geq d(G) + 1 when d(G)d(G) is odd, and n(G)≥⌈g2⌉−1n(G) \geq \lceil \frac{g}{2}\rceil - 1 for a graph containing cycles, where d(G)d(G) and gg are the diameter and girth of the graph GG, respectively. Furthermore, we characterize the extremal graphs for the cases of 2n(G)=d(G)+12n(G) = d(G) + 1, n(G)=⌈g2⌉n(G) = \lceil \frac{g}{2}\rceil, and n(G)=⌈g2⌉−1n(G) = \lceil \frac{g}{2}\rceil - 1.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.