The concept of A-like matrices, which originated in the study of tridiagonal pairs of linear transformations, was introduced by Stefko Miklavi c and Paul Terwilliger in The A-like matrices for a hypercube, Electronic Journal of Linear Algebra 22, 796-809, 2011. Let {u100000} denote a nite undirected graph with vertex set X. Let A 2 MatX(R) denote the adjacency matrix of {u100000}. A matrix B 2 MatX(R) is said to be A-like whenever both (i) BA = AB and (ii) for all x y 2 X that are neither equal nor adjacent, the (x y)-entry of B is zero. In their paper, Miklavi c and Terwilliger determined the subspace of MatX(R) consisting of all A-like matrices for a hypercube H(n; 2), where n 1 is an integer, and showed that its dimension is {u100000}n 2...
AbstractIn this note, we study the null space structure of singular real symmetric matrices with und...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
The M -partition problem can be stated as follows. Given a symmetric m × m matrixover {0, 1, ∗} we a...
Consider a simple undirected graph {u100000} with vertex set X. Let MatX(R) denote the R-algebra of ...
Given a bipartite graph $G$, the graphical matrix space $\mathcal{S}_G$ consists of matrices whose n...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractA necessary condition for Johnson's lower bound for the smallest singular value to hold with...
Some graphs $\varGamma$ have the following property $\cal P$: {\it the configuration graph (i.e. ...
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact ...
AbstractLet A be a singular M-matrix (or a strictly lower triangular matrix). The singular graph and...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...
AbstractWe consider a class of graphs subject to certain restrictions, including the finiteness of d...
AbstractTutte proved that, if two graphs, both with more than two vertices, have the same collection...
Given n×n matrices, A_1,...,A_k, define the linear operator L(A_1,...,A_k): Mat_n -> Mat_n by L(A_1,...
AbstractWe characterize the structure of null spaces of symmetric diagonally dominant (SDD) matrices...
AbstractIn this note, we study the null space structure of singular real symmetric matrices with und...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
The M -partition problem can be stated as follows. Given a symmetric m × m matrixover {0, 1, ∗} we a...
Consider a simple undirected graph {u100000} with vertex set X. Let MatX(R) denote the R-algebra of ...
Given a bipartite graph $G$, the graphical matrix space $\mathcal{S}_G$ consists of matrices whose n...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractA necessary condition for Johnson's lower bound for the smallest singular value to hold with...
Some graphs $\varGamma$ have the following property $\cal P$: {\it the configuration graph (i.e. ...
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact ...
AbstractLet A be a singular M-matrix (or a strictly lower triangular matrix). The singular graph and...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...
AbstractWe consider a class of graphs subject to certain restrictions, including the finiteness of d...
AbstractTutte proved that, if two graphs, both with more than two vertices, have the same collection...
Given n×n matrices, A_1,...,A_k, define the linear operator L(A_1,...,A_k): Mat_n -> Mat_n by L(A_1,...
AbstractWe characterize the structure of null spaces of symmetric diagonally dominant (SDD) matrices...
AbstractIn this note, we study the null space structure of singular real symmetric matrices with und...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
The M -partition problem can be stated as follows. Given a symmetric m × m matrixover {0, 1, ∗} we a...