

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in the spectrum of G. A unified approach is presented for the characterization of graphs of order n with η(G) = n − 4. All known results on trees, unicyclic graphs, bicyclic graphs, graphs with minimum degree 1, and r-partite graphs, for which η(G) = n − 4 are shown to be corollaries of a theorem of Chang, Huang and Yeh that characterizes all graphs with nullity n − 4. © 2023 University of Kragujevac, Faculty of Science. All rights reserved.
| Funding sponsor | Funding number | Acronym |
|---|---|---|
| Department of Science and Technology, Ministry of Science and Technology, India See opportunities by डीएसटी | CRG/2019/000238,MTR/2018/000156 | डीएसटी |
| Science and Engineering Research Board See opportunities by SERB | SERB |
Acknowledgment: Author Manjunatha Prasad Karantha acknowledge the support by Science and Engineering Research Board (DST), India through the projects CRG/2019/000238 and MTR/2018/000156
Karantha, M.P.; Department of Data Science, Prasanna School of Public Health, Manipal Academy of Higher Education, Karnataka, Manipal, India;
© Copyright 2023 Elsevier B.V., All rights reserved.