相关论文: Existence results for Kazdan-Warner type equations…

In this paper, we consider a relation between $k$-way expansion constant of a finite graph and the expansion constants of subgraphs in a $k$-partition of the graph. Using this relation, we show that a sequence of finite graphs which have…

Nowadays a great attention has been focused on the discrete fractional Laplace operator as the natural counterpart of the continuous one. In this paper, we discretize the fractional Laplace operator $(-\Delta)^{s}$ for an arbitrary finite…

A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…

We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…

In this paper, we study the discrete fractional Schr\"{o}dinger equation $$ (-\Delta)^\alpha u+h(x) u=f(x,u),\quad x\in \mathbb{Z}^d,$$ where $d\in\mathbb{N}^*,\,\alpha \in(0, 1)$ and the nonlocal operator $(-\Delta)^\alpha $ is defined by…

Assume $\alpha\geq p>1$. Consider the following $p$-th Yamabe equation on a connected finite graph $G$: $$\Delta_p\varphi+h\varphi^{p-1}=\lambda f\varphi^{\alpha-1},$$ where $\Delta_p$ is the discrete $p$-Laplacian, $h$ and $f>0$ are fixed…

One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

We consider the nonlinear Schr\"{o}dinger equation $-\Delta u+(\lambda a(x)+1)u=|u|^{p-1}u$ on a locally finite graph $G=(V,E)$. We prove via the Nehari method that if $a(x)$ satisfies certain assumptions, for any $\lambda>1$, the equation…

An equitable $k$-coloring of a graph is a proper $k$-coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connected graph $G$ has an equitable $k$-coloring for some $k\leq…

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…

In this paper, we study the existence and multiplicity of normalized solutions for the following $L^2$-supercritical Schr\"odinger equation on noncompact metric graph $\G=(\V,\E)$ with nonlinear point defects \begin{equation*} \begin{cases}…

The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this…

We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph $G=(V,E)$ on $n$ vertices and $k$…

Extending the notion of bounded variation, a function $u \in L_c^1(\mathbb R^n)$ is of bounded fractional variation with respect to some exponent $\alpha$ if there is a finite constant $C \geq 0$ such that the estimate \[ \biggl|\int u(x)…

We deal with a planar differential system of the form \begin{equation*} \begin{cases} \, u' = h(t,v), \\ \, v' = - \lambda a(t) g(u), \end{cases} \end{equation*} where $h$ is $T$-periodic in the first variable and strictly increasing in the…

Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\in H(v){4em}\hbox{for every}v\in V(G).$$ Let…

We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…