Related papers: Adjacency Matrices of Configuration Graphs

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

In real Hilbert spaces, this paper generalizes the orthogonal groups $\mathrm{O}(n)$ in two ways. One way is by finite multiplications of a family of operators from reflections which results in a group denoted as $\Theta(\kappa)$, the other…

Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

A universal adjacency matrix of a graph $G$ with adjacency matrix $A$ is any matrix of the form $U = \alpha A + \beta I + \gamma J + \delta D$ with $\alpha \neq 0$, where $I$ is the identity matrix, $J$ is the all-ones matrix and $D$ is the…

A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…

Given a simple graph $G$, its $A_\alpha$ matrix is a convex combination with parameter $\alpha\in [0,1]$ of its adjacency matrix and its degree diagonal matrices. Here we compare two lower bounds presented in [J. D. G. Silva Jr., C. S.…

Oriented line graph, introduced by Kotani and Sunada (2000), is closely related to Hashimato's non-backtracking matrix (1989). It is known that for regular graphs $G$, the eigenvalues of the adjacency matrix of the oriented line graph…

In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…

We establish rigidity theorems for graph product von Neumann algebras $M_\Gamma=*_{v,\Gamma}M_v$ associated to finite simple graphs $\Gamma$ and families of tracial von Neumann algebras $(M_v)_{v\in\Gamma}$. We consider the following three…

Some subadditivity results involving symmetric (unitarily invariant) norms are obtained. For instance, if $g(t)=\sum_{k=0}^m a_kt^k$ is a polynomial of degree $m$ with non-negative coefficients, then, for all positive operators $A,\,B$ and…

We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…

This is the first in a series of papers devoted to the theory of decomposition spaces, a general framework for incidence algebras and M\"obius inversion, where algebraic identities are realised by taking homotopy cardinality of equivalences…

We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on the s-rank of the matrix multiplication tensor imply upper bounds on the ordinary rank. In particular, if the "s-rank exponent of matrix…

Theta series for lattices with indefinite signature $(n_+,n_-)$ arise in many areas of mathematics including representation theory and enumerative algebraic geometry. Their modular properties are well understood in the Lorentzian case…

We say that a 0-1 matrix $N$ of size $a\times b$ can be found in a collection of sets $\mathcal{H}$ if we can find sets $H_{1}, H_{2}, \dots, H_{a}$ in $\mathcal{H}$ and elements $e_1, e_2, \dots, e_b$ in $\cup_{H \in \mathcal{H}} H$ such…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

For a simple signed graph $G$ with the adjacency matrix $A$ and net degree matrix $D^{\pm}$, the net Laplacian matrix is $L^{\pm}=D^{\pm}-A$. We introduce a new oriented incidence matrix $N^{\pm}$ which can keep track of the sign as well as…

A surprising result of FitzGerald and Horn (1977) shows that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite (p.s.d.) for every entrywise nonnegative $n \times n$ p.s.d. matrix $A = (a_{ij})$ if and only if $\alpha$ is a…

Let L_n be the n-dimensional Lorentz cone. A linear map M from R^m to R^n is called Lorentz-positive if M[L_m] is contained in L_n. We extend the notion of concurrence, which was initially introduced to quantify the entanglement of…