ABSTRACT
The positive (resp., negative) inertia index of a graph G, denoted by (resp.,
), is defined to be the number of positive (resp., negative) eigenvalues of its adjacency matrix. A simple result shows that
and
, where
is the diameter of G. In this paper we determine the sufficient and necessary conditions when each of the equalities holds.
AMS CLASSIFICATION:
Disclosure statement
No potential conflict of interest was reported by the authors.