相关论文: Smith Normal Form and Acyclic Matrics

For a given graph G and an associated class of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in G, the collection of all possible spectra for such matrices is considered. Building on the pioneering work…

Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…

This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

Graham-Lov\'asz-Pollak \cite{GL,GP} obtained the celebrated formula $$\det({\sf D}(T_{n+1}))=(-1)^nn2^{n-1},$$ for the determinant of the distance matrix ${\sf D}(T_{n+1})$ for any tree $T_{n+1}$ with $n+1$ vertices. Later, Hou and Woo…

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

The concept of unique normal form is formulated in terms of a spectral sequence. As an illustration of this technique some results of Baider and Churchill concerning the normal form of the anharmonic oscillator are reproduced. The aim of…

This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to…

The eccentricity matrix of a connected graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and setting the remaining entries as $0$. In this article, a conjecture about the…

The inverse eigenvalue problem of a given graph $G$ is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G$. Barrett et al. introduced the Strong Spectral Property…

The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…

Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the…

We study the manifold $Q_{\Gamma, \lambda}$ of isospectral real skew-symmetric matrices with a prescribed sparsity pattern determined by a graph $\Gamma$. The compact torus $T^n$ acts naturally on $Q_{\Gamma,\lambda}$ by conjugation, and…

One of the aims of this paper is to solve an open problem of Lovasz about relations between graph spectra and cut-distance. The paper starts with several inequalities between two versions of the cut-norm and the two largest singular values…

We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…

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…

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

Conditions are established under which the $p$-adic valuations of the invariant factors (diagonal entries of the Smith form) of an integer matrix are equal to the $p$-adic valuations of the eigenvalues. It is then shown that this…

We study the spectra of quantum graphs with the method of trace identities (sum rules), which are used to derive inequalities of Lieb-Thirring, Payne-P\'olya-Weinberger, and Yang types, among others. We show that the sharp constants of…