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
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its ...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spect...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
The nullity of a graph G, denoted by η(G) is defined to be the multiplicity of the eigenvalue zero i...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among n-v...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its ...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spect...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
The nullity of a graph G, denoted by η(G) is defined to be the multiplicity of the eigenvalue zero i...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among n-v...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its ...
DOI
Add to ORKG