Indexed by：
Abstract：
The nullity of a graph G, denoted by eta(G), is the multiplicity of the eigenvalue zero of its adjacency matrix. In this paper, we determine all graphs with eta(G) = n(G) - 2m(G) - c(G), where c(G) = e(G) - n(G) + omega(G), and n(G), e(G), m(G), and omega(G) are the vertex number, edge number, matching number, and the number of connected components of G, respectively.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
JOURNAL OF INEQUALITIES AND APPLICATIONS
ISSN： 1029-242X
Year： 2016
0 . 7 9 1
JCR@2016
1 . 5 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：76
JCR Journal Grade：2
CAS Journal Grade：3
Cited Count：
WoS CC Cited Count： 24
SCOPUS Cited Count： 24
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
