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

A typical Dirac-type problem in extremal graph theory is to determine the minimum degree threshold for a graph $G$ to have a spanning subgraph $H$, e.g. the Dirac theorem. A natural following up problem would be to seek an $H$-factor, which…

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an induced subgraph $H$ of a graph $G$ is $f$-heavy if for…

Suppose that $G=(V, E)$ is a connected locally finite graph with the vertex set $V$ and the edge set $E$. Let $\Omega\subset V$ be a bounded domain. Consider the following quasilinear elliptic equation on graph $G$ $$ \left \{…

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…

Let $G=(V,E)$ be a finite connected weighted graph, and assume $1\leq\alpha\leq p\leq q$. In this paper, we consider the following $p$-th Yamabe type equation $$-\Delta_pu+hu^{q-1}=\lambda fu^{\alpha-1}.$$ on $G$, where $\Delta_p$ is the…

We apply the quotient graph theory described by Band, Berkolaiko, Joyner and Liu to particular graphs symmetric with respect to $S_3$ and $C_3$ symmetry groups. We find the quotient graphs for the three-edge star quantum graph with Neumann…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all $\Delta\geq3$ and for all sufficiently large $n$, there is a simple $\Delta$-regular $n$-vertex graph with queue-number at…

Let $G=(V,E)$ be a finite graph. We consider the existence of solutions to a generalized Chern-Simons-Higgs equation $$ \Delta u=-\lambda e^{g(u)}\left( e^{g(u)}-1\right)^2+4\pi\sum\limits_{j=1}^{N}\delta_{p_j} $$ on $G$, where $\lambda$ is…

Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph $F$, there exists a quantity $c(F)$ such that $\chi(G) \leq (c(F) + o(1)) \Delta / \log\Delta$ whenever $G$ is an $F$-free graph of maximum degree $\Delta$. The…

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

In this paper, we study the semilinear elliptic equation of the form \begin{eqnarray*} -\Delta u+a(x)|u|^{p-2}u-b(x)|u|^{q-2}u=0 \end{eqnarray*} on lattice graphs $\mathbb{Z}^{N}$, where $N\geq 2$ and $2\leq p<q<+\infty$. By the…

In this paper we study the problem \[ \begin{cases} -\Delta_d u = \mu_0 &\text{ in } G\\ u = 0 &\text{ on } \partial G \end{cases} \] where, $\Delta_d$ represent the discret Laplacian, and $\mu_0$ it is a measure defined in the vertex of…

In this paper, we study fan-planar drawings that use $h$ layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fixed-parameter…

Let $G=(V,E)$ be a locally finite connected weighted graph, and $\Omega$ be an unbounded subset of $V$. Using Rothe's method, we study the existence of solutions for the semilinear heat equation $\partial_tu+|u|^{p-1}\cdot u=\Delta…

Let $G=(V,E)$ be a finite or locally finite connected weighted graph, $\Delta$ be the usual graph Laplacian. Using heat kernel estimate, we prove the existence and nonexistence of global solutions for the following semilinear heat equation…

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…