DOIAbstract
AbstractThe main result consists of a combinatorial characterization of weakly cyclic matrices of odd index. The case of even index is also considered
AbstractThe main result consists of a combinatorial characterization of weakly cyclic matrices of odd index. The case of even index is also considered
We resolve two conjectures of Hriňáková et al. (2019)[10] concerning the relationship between the va...
The cycle index of dihedral group acting on the set of the vertices of a regular-gon was studied (Se...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
AbstractThe main result consists of a combinatorial characterization of weakly cyclic matrices of od...
A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour co...
AbstractWe associate a signed digraph with a list of matrices whose dimensions permit them to be mul...
Abstract. A binary matrix has the consecutive ones property (C1P) if it is possible to order the col...
We combine matrix theory and graph theory methods to give a complete characterization of the surject...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
AbstractA sign-nonsingular matrix or L-matrix A is a real m× n matrix such that the columns of any r...
AbstractWe study the strong chromatic index of multigraphs whose underlying graph is a cycle. In thi...
In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant ...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
AbstractLet A be an M-matrix and B a nonnegative matrix. It is shown that with some additional const...
We resolve two conjectures of Hriňáková et al. (2019)[10] concerning the relationship between the va...
The cycle index of dihedral group acting on the set of the vertices of a regular-gon was studied (Se...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
AbstractThe main result consists of a combinatorial characterization of weakly cyclic matrices of od...
A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour co...
AbstractWe associate a signed digraph with a list of matrices whose dimensions permit them to be mul...
Abstract. A binary matrix has the consecutive ones property (C1P) if it is possible to order the col...
We combine matrix theory and graph theory methods to give a complete characterization of the surject...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
AbstractA sign-nonsingular matrix or L-matrix A is a real m× n matrix such that the columns of any r...
AbstractWe study the strong chromatic index of multigraphs whose underlying graph is a cycle. In thi...
In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant ...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
AbstractLet A be an M-matrix and B a nonnegative matrix. It is shown that with some additional const...
We resolve two conjectures of Hriňáková et al. (2019)[10] concerning the relationship between the va...
The cycle index of dihedral group acting on the set of the vertices of a regular-gon was studied (Se...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
Add to ORKG