相关论文: Brouwer degree for Kazdan-Warner equations on a co…
We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.
In this paper we consider the Schr\"odinger equation on a network formed by a tree with the last generation of edges formed by infinite strips. We give an explicit description of the solution of the linear Schr\"odinger equation with…
Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector…
In this paper, we investigate bounds for the following judicious $k$-partitioning problem: Given an edge-weighted graph $G$, find a $k$-partition $(V_1,V_2,\dots ,V_k)$ of $V(G)$ such that the total weight of edges in the heaviest induced…
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to…
The fine curve graph was introduced to study homeomorphism group of surfaces. In this paper we study the topology of the Gromov boundary of this graph for closed surfaces with higher genus. We first prove a bounded geodesic image theorem…
The degree distribution is a key statistical indicator in network theory, often used to understand how information spreads across connected nodes. In this paper, we focus on non-growing networks formed through a rewiring algorithm and…
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study…
In this paper, we study degree conditions for three types of disjoint directed path cover problems: many-to-many $k$-DDPC, one-to-many $k$-DDPC and one-to-one $k$-DDPC, which are intimately connected to other famous topics in graph theory,…
We characterize the classical Boltzmann distribution as the unique solution to a certain combinatorial Hodge theory problem in homological degree zero on a finite graph. By substituting for the graph a CW complex and a degree d, we are able…
For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine structure of graphs whose degree sequences contain either…
We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…
We explore singular second-order boundary value problems with mixed boundary conditions on a general time scale. Using the lower and upper solutions method combined with the Brouwer fixed point theorem we demonstrate the existence of a…
In this paper, we use the maximum principle to get the gradient estimate for the solutions of the prescribed mean curvature equation with Neumann boundary value problem, which gives a positive answer for the question raised by Lieberman…
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…
In this paper, we establish local well-posedness for the Cauchy problem associated with the Kawahara equation on a general metric star graph. Initially, we identify suitable boundary conditions that produce a well-behaved dynamics for the…
We provide explicit and unified formulas for the cocycles of all degrees on the normalized bar resolutions of finite abelian groups. This is achieved by constructing a chain map from the normalized bar resolution to a Koszul-like resolution…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is…