Related papers: Scattering the geometry of weighted graphs

We consider a non-self-adjoint $H$ given as the perturbation of a self-adjoint operator $H_0$. We suppose that $H$ is of the form $H=H_0+CWC$ where $C$ is a bounded, positive definite and relatively compact with respect to $H_0$, and $W$ is…

A graph $G=(V,E)$ is total weight $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers,…

A graph $G=(V,E)$ is called $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a mapping…

For a graph with $n$ vertices and $m$ edges, having Laplacian spectrum $\mu_1, \mu_2, \cdots,\mu_n$ and signless Laplacian spectrum $\mu^+_1,\mu^+_2, \cdots,\mu^+_n$, the Laplacian energy and signless Laplacian energy of $G$ are…

In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…

Let ${\gamma_q(n)}_{n \in \mathbb{N}}$ be the lengths of spectral gaps in a continuous spectrum of the Hill-Schr\"odinger operators S(q)u=-u''+q(x)u,\quad x\in \mathbb{R}, with 1-periodic real-valued potentials $q \in L^{2}(\mathbb{T})$.…

Let $n\geq m$ be two positive integers, $S_{n,m}=K[x_1,\ldots,x_n,y_1,\ldots,y_m]$ and $I_{n,m}=(x_iy_j\;:\;1\leq i\leq n,1\leq j\leq m)\subset S_{n,m}$ the edge ideal of a complete bipartite graph. Denote…

We show the existence and orthogonality of wave operators naturally associated to a compatible Laplacian on a complete manifold with a corner of codimension 2. In fact, we prove asymptotic completeness i.e. that the image of these wave…

In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…

We work in the setting of infinite, not necessarily locally finite, weighted graphs. We give a sufficient condition for the essential self-adjointness of (discrete) Schr\"odinger operators $\mathcal{L}_{V}$ that are not necessarily lower…

Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…

Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. A graph $G$ is $k$-vertex-critical if every proper induced subgraph of $G$ has chromatic number less than $k$,…

In this paper, we study the $L(2, 1)$-Labeling of the Mycielski and the iterated Mycielski of graphs in general. For a graph $G$ and all $t\geq 1$, we give sharp bounds for $\lambda(M^t(G))$ the $L(2, 1)$-labeling number of the $t$-th…

Let $g$ and $\tilde{g}$ be Riemannian metrics on a noncompact manifold $M$, which are conformally equivalent. We show that under a very mild \emph{first order} control on the conformal factor, the wave operators corresponding to the…

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

An $L(h_1, h_2, \ldots, h_l)$-labelling of a graph $G$ is a mapping $\phi: V(G) \rightarrow \{0, 1, 2, \ldots\}$ such that for $1\le i\le l$ and each pair of vertices $u, v$ of $G$ at distance $i$, we have $|\phi(u) - \phi(v)| \geq h_i$.…

We consider in this paper space-cutoff charged $P(\varphi)_{2}$ models arising from the quantization of the non-linear charged Klein-Gordon equation: \[ (\p_{t}+\i V(x))^{2}\phi(t, x)+ (-\Delta_{x}+ m^{2})\phi(t,x)+…

Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…

Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…

The $\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-factor of a graph is a spanning subgraph whose each component is an element of $\{K_{1,1}, K_{1,2},C_m: m\geq3\}$. In this paper, through the graph spectral methods, we establish the lower bound of the…