相关论文: Strong Cospectrality and Twin Vertices in Weighted…
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.
We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there…
We discuss spectral properties of an periodic quantum graph consisting of an array of rings coupled either tightly or loosely through connecting links, assuming that the vertex coupling is manifestly non-invariant with respect to the time…
This paper studies critical ideals of graphs with twin vertices, which are vertices with the same neighbors. A pair of such vertices are called replicated if they are adjacent, and duplicated, otherwise. Critical ideals of graphs having…
The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between…
Perfect state transfer and fractional revival can be used to move information between pairs of vertices in a quantum network. While perfect state transfer has received a lot of attention, fractional revival is newer and less studied. One…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
We develop a formalism to compute the statistics of the top eigenpair of weighted sparse graphs with finite mean connectivity and bounded maximal degree. Framing the problem in terms of optimisation of a quadratic form on the sphere and…
It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…
Manifestly non-Hermitian quantum graphs with real spectra are introduced and shown tractable as a new class of phenomenological models with several appealing descriptive properties. For illustrative purposes, just equilateral star-graphs…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{i}$ the degree of vertex $v_{i}$. Let $f(x, y)>0$ be a real symmetric function in $x$ and $y$. The weighted adjacency matrix $A_{f}(G)$ of a graph $G$ is a square matrix, where the…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note…
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…
A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…
A mixed circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer (PST for short) and multiple state…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…