| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602635 | Linear Algebra and its Applications | 2009 | 7 Pages |
Abstract
The nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spectrum of the adjacency matrix of the graph. In this paper, we obtain the nullity set of bipartite graphs of order n, and characterize the bipartite graphs with nullity n-4 and the regular bipartite graphs with nullity n-6.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
