相关论文: Spectral analysis for adjacency operators on graph…

We study the nullspace of the adjacency matrix of split graphs, whose vertex set can be partitioned into a clique and an independent set. We introduce the clique-kernel, a subspace that decides whether clique vertices lie in the support of…

Let $G$ be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao that if the Cayley graph $C(G,S)$ is an expander graph and is non-bipartite then the spectrum of the adjacency operator $T$ is bounded away from $-1$. In this…

A few properties of unitary Cayley graphs are explored using their eigenvalues. It is shown that the adjacency algebra of a unitary Cayley graph is a coherent algebra. Finally, a class of unitary Cayley graphs that are distance regular are…

Let $\mathbf{A}$ be a bounded self-adjoint operator on a separable Hilbert space $\mathfrak{H}$ and $\mathfrak{H}_0\subset\mathfrak{H}$ a closed invariant subspace of $\mathbf{A}$. Assuming that $\mathfrak{H}_0$ is of codimension 1, we…

For a ring $R$, the zero-divisor graph is a simple graph $\Gamma(R)$ whose vertex set is the set of all non-zero zero-divisors in a ring $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy=0$ or $yx=0$ in $R$. By…

The power graph $\mathscr{P}(G)$ of a group $G$ is an undirected graph with all the elements of $G$ as vertices and where any two vertices $u$ and $v$ are adjacent if and only if $u=v^m $ or $v=u^m$, $ m \in$ $\mathbb{Z}$. For a simple…

Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…

The spectral problem for self-adjoint extensions is studied using the machinery of boundary triplets. For a class of symmetric operators having Weyl functions of a special type we calculate explicitly the spectral projections in the form of…

We study signals that are sparse in graph spectral domain and develop explicit algorithms to reconstruct the support set as well as partial components from samples on few vertices of the graph. The number of required samples is independent…

A new geometric proof of the spectral theorem for unbounded self-adjoint operators A in a Hilbert space H is given based on a splitting of A in positive and negative parts A+ and A-. For both operators A+ and A- the spectral family can be…

This paper is devoted to the spectral properties of a class of unitary operators with a matrix representation displaying a band structure. Such band matrices appear as monodromy operators in the study of certain quantum dynamical systems.…

We study both $H$ and $E/Z$-eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive $H$ or $Z$-eigenvalue corresponds to a strictly positive eigenvector. We also investigate when…

We investigate properties of signed graphs that have few distinct eigenvalues together with a symmetric spectrum. Our main contribution is to determine all signed $(0,2)$-graphs with vertex degree at most $6$ that have precisely two…

We define a class of pseudo-ergodic non-self-adjoint Schr\"odinger operators acting in spaces $l^2(X)$ and prove some general theorems about their spectral properties. We then apply these to study the spectrum of a non-self-adjoint Anderson…

The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…

We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…

The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph,…

It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.

We are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. We assume $\Omega$ to be Lebesgue measurable with regular boundary and contained,…

In this article, the existence of the spectrum (the eigenvalues) for the nonlinear continuous operators acting in the Banach spaces is investigated. For the study, this question is used a different approach that allows the studying of all…