Add to ORKGAbstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in its spectrum. It is known that (G) n 2 if G is a simple graph on n vertices and G is not isomorphic to nK1. In this paper, we characterize the extremal graphs attaining the upper bound n 2 and the second upper bound n 3. The maximum nullity of simple graphs with n vertices and e edges, M(n; e), is also discussed. We obtain an upper bound of M(n; e), and characterize n and e for which the upper bound is achieved
[[abstract]]By |V(G)|, |E(G)|, η(G), and m(G) we denote respectively the order, the number of edges,...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
Abstract. A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not neces...
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...
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. Among n-v...
The nullity of a graph G, denoted by η(G) is defined to be the multiplicity of the eigenvalue zero i...
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 G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
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 is defined as the multiplicity of the eigenvalue zero in the spectrum...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
Let G=(V,E) be a undirected graph containing n vertices, and let be the set of all Hermitian n×n mat...
[[abstract]]By |V(G)|, |E(G)|, η(G), and m(G) we denote respectively the order, the number of edges,...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
Abstract. A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not neces...
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...
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. Among n-v...
The nullity of a graph G, denoted by η(G) is defined to be the multiplicity of the eigenvalue zero i...
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 G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
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 is defined as the multiplicity of the eigenvalue zero in the spectrum...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
Let G=(V,E) be a undirected graph containing n vertices, and let be the set of all Hermitian n×n mat...
[[abstract]]By |V(G)|, |E(G)|, η(G), and m(G) we denote respectively the order, the number of edges,...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
Abstract. A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not neces...