DOIAbstract
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we obtain the nullity set of n-vertex unicyclic graphs, and characterize the unicyclic graphs with extremal nullity
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we obtain the nullity set of n-vertex unicyclic graphs, and characterize the unicyclic graphs with extremal nullity
We consider the algebraic and geometric multiplicity of hypergraph eigenvalues, paying particular at...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
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...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
The nullity of a graph G, denoted by η(G) is defined to be the multiplicity of the eigenvalue zero i...
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is...
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...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
We consider the algebraic and geometric multiplicity of hypergraph eigenvalues, paying particular at...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
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...
Abstract. The nullity of a graph G, denoted by (G), is the multiplicity of the eigenvalue zero in it...
AbstractLet G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the n...
The nullity of a graph G, denoted by η(G) is defined to be the multiplicity of the eigenvalue zero i...
AbstractThe spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nu...
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is...
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...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
We consider the algebraic and geometric multiplicity of hypergraph eigenvalues, paying particular at...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
Add to ORKG