相关论文: Smith Normal Form and Acyclic Matrics

We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…

Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…

For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…

Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…

The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

Smith homomorphisms are maps between bordism groups that change both the dimension and the tangential structure. We give a completely general account of Smith homomorphisms, unifying the many examples in the literature. We provide three…

We analyze the spectral distribution of symmetric random matrices with correlated entries. While we assume that the diagonals of these random matrices are stochastically independent, the elements of the diagonals are taken to be correlated.…

In this paper, we give an explicit formula for the rank of the $Q$-walk matrix of the Dynkin graph $A_n$. Moreover, we prove that its Smith normal form is $$ \mathrm{diag}\left( \underset{r=\lceil \frac{n}{2}…

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…

The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…

Given a connected graph $R$ on $r$ vertices and a rooted graph $H,$ let $R\{H\}$ be the graph obtained from $r$ copies of $H$ and the graph $R$ by identifying the root of the $i-th$ copy of $H$ with the $i-th$ vertex of $R$. Let…

Permutation equivariant neural networks are typically used to learn from data that lives on a graph. However, for any graph $G$ that has $n$ vertices, using the symmetric group $S_n$ as its group of symmetries does not take into account the…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

A mixed tree is a tree in which both directed arcs and undirected edges may exist. Let $T$ be a mixed tree with $n$ vertices and $m$ arcs, where an undirected edge is counted twice as arcs. Let $A$ be the adjacency matrix of $T$. For…

Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems as smooth unconstrained problems over the set of symmetric matrices which are then solved via the cubic-regularized Newton method. A…

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…