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
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spect...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
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. In this p...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among n-v...
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...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spect...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
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. In this p...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among n-v...
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...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
DOI
Add to ORKG