相关论文: Brouwer degree for Chern-Simons Higgs models on fi…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

An immersion of a graph H in another graph G is a one-to-one mapping phi:V(H)->V(G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P_{uv} corresponding to the edge uv has endpoints phi(u) and…

In this paper, we consider the existence and multiplicity of solutions for the logarithmic Schr\"{o}dinger equation on lattice graphs $\mathbb{Z}^N$ $$ -\Delta u+V(x) u=u \log u^2, \quad x \in \mathbb{Z}^N, $$ When the potential $V$ is…

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…

The Ramsey's theorem says that a graph with sufficiently many vertices contains a clique or stable set with many vertices. Now we attach some parameter to every vertex, such as degree. Consider the case a graph with sufficiently many…

In this paper we are concerned with the number of nonnegative solutions of the elliptic system $$ {array}{ll} -\Delta u = Q_u(u,v) + 1/2{2^*} H_u(u,v),& {in} \Omega,\vdois\ -\Delta v = Q_v(u,v) + 1/{2^*} H_v(u,v),& {in} \Omega,\vdois\…

We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z} : v \in V\}$, let $\mathcal N (G; \prod_{v \in V} \mathsf…

We investigate the existence of non-topological solutions $(u_1,u_2)$ satisfying $$u_{i}(x)=-2\beta_i\ln|x|+O(1),\quad\text{as }|x|\rightarrow +\infty,$$ such that $\beta_i>1$ and $$(\beta_1-1)(\beta_2-1)>(N_1+1)(N_2+1),$$ for a…

We perform a detailed statistical study of the distribution of topological and spectral indices on random graphs $G=(V,E)$ in a wide range of connectivity regimes. First, we consider degree-based topological indices (TIs), and focus on two…

A sequence of nonnegative integers \pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \pi. In this case, G is said to realize or be a realization of \pi. Degree sequence results in the literature generally…

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 study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…

We prove that for all $k \ge 3$ and any integers $\Delta, n$ with $n \ge 2^\Delta,$ there exists a $k$-graph on $n$ vertices with maximum degree at most $\Delta$ such that $r(H)\geq\tw_{k-1}(c_k \Delta) \cdot n$ for some constant $c_k > 0$,…

Let $G=(V,E)$ be a locally finite graph, $\Omega\subset V$ be a bounded domain, $\Delta$ be the usual graph Laplacian, and $\lambda_1(\Omega)$ be the first eigenvalue of $-\Delta$ with respect to Dirichlet boundary condition. Using the…

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Chern-Simons gauge theory, since its inception as a topological quantum field theory, has proved to be a rich source of understanding for knot invariants. In this work the theory is used to explore the definition of the expectation value of…

The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…

A subgraph $H$ of a multigraph $G$ is overfull if $ |E(H) | > \Delta(G) \lfloor |V(H)|/2 \rfloor$. Analogous to the Overfull Conjecture proposed by Chetwynd and Hilton in 1986, Stiebitz et al. in 2012 formed the multigraph version of the…

Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to…

This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…