AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among n-vertex trees, the star has greatest nullity (equal to n−2). We generalize this by showing that among n-vertex trees whose vertex degrees do not exceed a certain value D, the greatest nullity is n−2⌈(n−1)/D⌉. Methods for constructing such maximum-nullity trees are described
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
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. Among n-v...
Let T be a tree with n >= 2 vertices. Set 8(T) for the set of all real symmetric matrices whose grap...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spect...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractFor a graph G of order n, the maximum nullity of G is defined to be the largest possible nul...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
For a graph G of order n, the maximum nullity of G is defined to be the largest possible nullity ove...
The maximum nullity of a simple graph $ G $ over a field $ \mathcal{F} $ is the maximum nullity over...
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On...
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
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. Among n-v...
Let T be a tree with n >= 2 vertices. Set 8(T) for the set of all real symmetric matrices whose grap...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractThe nullity of a graph is defined to be the multiplicity of the eigenvalue zero in the spect...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractFor a graph G of order n, the maximum nullity of G is defined to be the largest possible nul...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
For a graph G of order n, the maximum nullity of G is defined to be the largest possible nullity ove...
The maximum nullity of a simple graph $ G $ over a field $ \mathcal{F} $ is the maximum nullity over...
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On...
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
DOI
Add to ORKG