AbstractWe characterize all sequences η and λ such that there exists a matrix A with simple singular vertices in its reduced graph, with height characteristic η, and with level characteristic λ
AbstractLet S be a singular graph. We study conditions on the vertices of S to extend Jordan chains ...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrice...
AbstractWe characterize all sequences η and λ such that there exists a matrix A with simple singular...
AbstractFor a loopless, acyclic, transitive directed graph, we give a new result about the relation ...
AbstractA recently proven graph theoretic lower bound for the nullity of powers of matrices in a tri...
AbstractIt is shown that the height characteristic of a block triangular matrix A with square diagon...
[[abstract]]For a loopless, acyclic, transitive directed graph, we give a new result about the relat...
It is shown that the height characteristic of a block triangular matrix A with square diagonal block...
AbstractUsing graph theoretic techniques, it is shown that the height characteristic of a triangular...
AbstractLet A be a singular M-matrix (or a strictly lower triangular matrix). The singular graph and...
AbstractIt is shown that the height characteristics of a matrix A strongly majorizes the dual sequen...
AbstractWe introduce the concepts of peak characteristic of an M-matrix A and of peak signature and ...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
AbstractLet G be a graph without loops and multiple edges. If V(G) = (V[in1]), V2, …, vn, we define ...
AbstractLet S be a singular graph. We study conditions on the vertices of S to extend Jordan chains ...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrice...
AbstractWe characterize all sequences η and λ such that there exists a matrix A with simple singular...
AbstractFor a loopless, acyclic, transitive directed graph, we give a new result about the relation ...
AbstractA recently proven graph theoretic lower bound for the nullity of powers of matrices in a tri...
AbstractIt is shown that the height characteristic of a block triangular matrix A with square diagon...
[[abstract]]For a loopless, acyclic, transitive directed graph, we give a new result about the relat...
It is shown that the height characteristic of a block triangular matrix A with square diagonal block...
AbstractUsing graph theoretic techniques, it is shown that the height characteristic of a triangular...
AbstractLet A be a singular M-matrix (or a strictly lower triangular matrix). The singular graph and...
AbstractIt is shown that the height characteristics of a matrix A strongly majorizes the dual sequen...
AbstractWe introduce the concepts of peak characteristic of an M-matrix A and of peak signature and ...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
AbstractLet G be a graph without loops and multiple edges. If V(G) = (V[in1]), V2, …, vn, we define ...
AbstractLet S be a singular graph. We study conditions on the vertices of S to extend Jordan chains ...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrice...
DOI
Add to ORKG