AbstractA characterization of a class of symmetric (0, 1) matrices A such that AP is a symmetric matrix too, where P is a permutation matrix, is given, and an application to double coverings of graphs is considered
AbstractA bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. ...
An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...
AbstractIt is shown that if a nonsingular linear transformation T on the space of n-square real symm...
AbstractA characterization of a class of symmetric (0, 1) matrices A such that AP is a symmetric mat...
AbstractThis paper presents a brief survey of some of the recent results on combinatorially symmetri...
AbstractA characterization is given of those n×n real matrices A which satisfy En−1(PA) = En−1(A) fo...
The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of Johnson...
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of...
Introduction and definitions. A conference matrix of order n is a square matrix C with zeros on the ...
AbstractThe group algebra of the symmetric group is used to derive a general enumerative result asso...
AbstractAn n×n matrix is called an N-matrix if all its principal minors are negative. In this paper,...
AbstractA (0, 1) matrix (aij) is said to be a ∗ matrix iff aij = 1 implies ai′j′ = 1 for all (i′, j′...
AbstractIt is shown that if a linear transformation T on the space of n-square symmetric matrices ov...
AbstractIn this paper we investigate generalized circulant permutation matrices of composite order. ...
AbstractWe present two criteria for nonsingularity of matrices over general fields. The first applie...
AbstractA bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. ...
An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...
AbstractIt is shown that if a nonsingular linear transformation T on the space of n-square real symm...
AbstractA characterization of a class of symmetric (0, 1) matrices A such that AP is a symmetric mat...
AbstractThis paper presents a brief survey of some of the recent results on combinatorially symmetri...
AbstractA characterization is given of those n×n real matrices A which satisfy En−1(PA) = En−1(A) fo...
The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of Johnson...
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of...
Introduction and definitions. A conference matrix of order n is a square matrix C with zeros on the ...
AbstractThe group algebra of the symmetric group is used to derive a general enumerative result asso...
AbstractAn n×n matrix is called an N-matrix if all its principal minors are negative. In this paper,...
AbstractA (0, 1) matrix (aij) is said to be a ∗ matrix iff aij = 1 implies ai′j′ = 1 for all (i′, j′...
AbstractIt is shown that if a linear transformation T on the space of n-square symmetric matrices ov...
AbstractIn this paper we investigate generalized circulant permutation matrices of composite order. ...
AbstractWe present two criteria for nonsingularity of matrices over general fields. The first applie...
AbstractA bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. ...
An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...
AbstractIt is shown that if a nonsingular linear transformation T on the space of n-square real symm...
DOI
Add to ORKG