Back to Search
Start Over
On the nullity of bipartite graphs
- Source :
- Linear Algebra and its Applications. 430(11-12):2943-2949
- Publication Year :
- 2009
- Publisher :
- Elsevier BV, 2009.
-
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 .
- Subjects :
- Discrete mathematics
Numerical Analysis
Dense graph
Mathematics::Combinatorics
Algebra and Number Theory
Mathematics::Rings and Algebras
Strong perfect graph theorem
Graph theory
Complete bipartite graph
Combinatorics
Computer Science::Discrete Mathematics
Spectrum
Bipartite graph
Discrete Mathematics and Combinatorics
Regular graph
Adjacency matrix
Mathematics::Differential Geometry
Geometry and Topology
Nullity
Eigenvalues and eigenvectors
Mathematics
Bipartite graphs
Subjects
Details
- ISSN :
- 00243795
- Volume :
- 430
- Issue :
- 11-12
- Database :
- OpenAIRE
- Journal :
- Linear Algebra and its Applications
- Accession number :
- edsair.doi.dedup.....83e3476223acb0a960024e617a922770
- Full Text :
- https://doi.org/10.1016/j.laa.2009.01.007