
AbstractThe 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.
Numerical Analysis, Algebra and Number Theory, Spectrum, Discrete Mathematics and Combinatorics, Geometry and Topology, Nullity, Bipartite graphs
Numerical Analysis, Algebra and Number Theory, Spectrum, Discrete Mathematics and Combinatorics, Geometry and Topology, Nullity, Bipartite graphs
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 66 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
