Add to ORKGA graph is singular of nullity n if zero is an eigenvalue of its adjacency matrix with multiplicity n. A subgraph that forces a graph to be singular is called a minimal configuration. We show various properties of minimal configurations.peer-reviewe
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractIf G is a planar graph of smallest order such that the stability number of G is less than on...
AbstractThis paper studies singular graphs by considering minimal singular induced subgraphs of smal...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
A nut graph has a non-invertible (singular) 0-1 adjacency matrix with non-zero entries in every kern...
A singular graph, with adjacency matrix A and one zero eigenvalue, has a corresponding eigenvector v...
The nullity of a graph G is the multiplicity of zero as an eigenvalue in the spectrum of its adjacen...
A graph is singular if its adjacency matrix is singular. In this note a parameter T(G), termed the c...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a gra...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
A graph G is singular of nullity η if the nullspace of its adjacency matrix G has dimension η. Such ...
AbstractA graph is k-minimal with respect to some parameter if the removal of any j edges j<k reduce...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractIf G is a planar graph of smallest order such that the stability number of G is less than on...
AbstractThis paper studies singular graphs by considering minimal singular induced subgraphs of smal...
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of ...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
A nut graph has a non-invertible (singular) 0-1 adjacency matrix with non-zero entries in every kern...
A singular graph, with adjacency matrix A and one zero eigenvalue, has a corresponding eigenvector v...
The nullity of a graph G is the multiplicity of zero as an eigenvalue in the spectrum of its adjacen...
A graph is singular if its adjacency matrix is singular. In this note a parameter T(G), termed the c...
AbstractLet G be a simple graph of order n and A(G) be its adjacency matrix. The nullity of a graph ...
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a gra...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
A graph G is singular of nullity η if the nullspace of its adjacency matrix G has dimension η. Such ...
AbstractA graph is k-minimal with respect to some parameter if the removal of any j edges j<k reduce...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractIf G is a planar graph of smallest order such that the stability number of G is less than on...