Related papers: Existence results for Kazdan-Warner type equations…

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao…

In this paper, we study the following $p$-Laplacian equation $$ -\Delta_{p} u+h(x)|u|^{p-2} u=\left(R_{\alpha} *F(u)\right)f(u) $$ on lattice graphs $\mathbb{Z}^N$, where $p\geq 2$, $\alpha \in(0,N)$ are constants and $R_{\alpha}$ is the…

For a symmetric bivariable function $f(x,y)$, let the {\it connectivity function} of a connected graph $G$ be $M_f(G)=\sum_{uv\in E(G)}f(d(u),d(v))$, where $d(u)$ is the degree of vertex $u$. In this paper, we prove that for an escalating…

A new filtration of the spaces of tri-/univalent graphs B_m^u that occur in the theory of finite-type invariants of knots and 3-manifolds is introduced. Combining the results of the two preceding articles, the quotients of this filtration…

In this work we obtain a Liouville theorem for positive, bounded solutions of the equation $$ (-\Delta)^s u= h(x_N)f(u) \quad \hbox{in }\mathbb{R}^{N} $$ where $(-\Delta)^s$ stands for the fractional Laplacian with $s\in (0,1)$, and the…

In this paper, we solve some constrained variational problems on perturbed lattice graphs $G$. The first problem addresses the existence of ground state normalized solutions to Schr\"odinger equations \begin{equation*} \left\{…

We show that the median eigenvalues of every connected graph of maximum degree at most three, except for the Heawood graph, are at most $1$ in absolute value, resolving open problems posed by Fowler and Pisanski, and by Mohar.

We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibility of H. The exact value of this quantity is known only for…

The Brouwer's toughness conjecture states that every $d$-regular connected graph always has $t(G)>\frac{d}{\lambda}-1$ where $\lambda$ is the second largest absolute eigenvalue of the adjacency matrix. In 1988, Enomoto introduced a…

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…

An out-branching $B^+_u$ (in-branching $B^-_u$) in a digraph $D$ is a connected spanning subdigraph of $D$ in which every vertex except the vertex $u$, called the root, has in-degree (out-degree) one. A {\bf good $\mathbf{(u,v)}$-pair} in…

This paper is the second part of the study initiated in a companion work and is devoted to finite-time blow-up and global existence for a semilinear heat equation on infinite weighted graphs. We first establish basic results on mild and…

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components. We show that strongly regular…

Let $V$ be a locally finite, connected and weighted graph. We study non-existence results of non-trivial, non-negative solutions of the system $$ \begin{cases} u_{t t}-\Delta u \geq h_1|v|^p & \text { in } V \times(0, \infty), v_{t…

The Wiener index, $W(G)$, of a connected graph $G$ is the sum of distances between its vertices. In 2021, Akhmejanova et al. posed the problem of finding graphs $G$ with large $R_m(G)= |\{v\in V(G)\,|\,W(G)-W(G-v)=m \in \mathbb{Z} \}|/…

Mader [J. Combin. Theory Ser. B 40 (1986) 152-158] proved that every $k$-edge-connected graph $G$ with minimum degree at least $k+1$ contains a vertex $u$ such that $G-\{u\}$ is still $k$-edge-connected. In this paper, we prove that every…

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

For a subgraph $G$ of the blow-up of a graph $F$, we let $\delta^*(G)$ be the smallest minimum degree over all of the bipartite subgraphs of $G$ induced by pairs of parts that correspond to edges of $F$. In [Triangle-factors in a balanced…

We consider the Schr\"{o}dinger equation $-\Delta u +V(x)u=f(x, u)$, where $V$ is periodic and $f$ is non-periodic, 0 is a boundary point of the continuous spectrum of $A:=-\Delta +V(x)$. We use M. Willem and W. M. Zou's linking theorem and…