Related papers: Essential selfadjointness of the graph-Laplacian

In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…

A graph $G$ is said to be equitably $c$-colorable if its vertices can be partitioned into $c$ independent sets that pairwise differ in size by at most one. Chen, Lih, and Wu conjectured that every connected graph $G$ with maximum degree…

Motivated by potential theory on discrete spaces, we study a family of unbounded Hermitian operators in Hilbert space which generalize the usual graph-theoretic discrete Laplacian. These operators are discrete analogues of the classical…

The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…

We study extensions of direct sums of symmetric operators $S=\oplus_{n\in\mathbb{N}} S_n$. In general there is no natural boundary triplet for $S^*$ even if there is one for every $S_n^*$, $n\in\mathbb{N}$. We consider a subclass of…

A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…

We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

On a star graph $G$ with $n = n_+ + n_-$ edges of unit length, we study the operator $-\frac{\mathrm{d}^2}{\mathrm{d} x^2}$ on $n_+$ and $\frac{\mathrm{d}^2}{\mathrm{d} x^2}$ on $n_-$ edges equipped with Dirichlet boundary conditions at the…

The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. It is a known result…

Consider the Dirichlet Laplacian operator $-\Delta^D$ in a periodic waveguide $\Omega$. On the condition that $\Omega$ is sufficiently thin, we show that its spectrum $\sigma(-\Delta^D)$ is absolutely continuous (in each finite region). In…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

We establish explicit operator norm bounds and essential self-adjointness criteria for discrete Hodge Laplacians on weighted graphs and simplicial complexes. For unweighted $d$-regular graphs we prove the universal estimate…

The rank $r(G)$ of a graph $G$ is the rank of its adjacency matrix $A(G)$ and the nullity $\eta(G)$ of $G$ is the multiplicity of $0$ as an eigenvalue of $A(G)$. In this paper, we prove that if $G$ is a connected graph of order $n$ with…

We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p <…

{Signless Laplacian determinations of some graphs with independent edges}% {Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the…

In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…

The behaviour of the spectral edges (embedded eigenvalues and resonances) is discussed at the two ends of the continuous spectrum of non-local discrete Schr\"odinger operators with a $\delta$-potential. These operators arise by replacing…

It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…

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,…