English
Related papers

Related papers: A graph theoretical Poincare-Hopf Theorem

200 papers

We prove the Nitsche--Hopf conjecture for non-parametric minimal graphs over disks. If \(S\) is a minimal graph over a disk of radius \(R\), and if \(\xi\) is the point above the center, then \[ W(\xi)^2 |K(\xi)|<\frac{\pi^2}{2R^2}. \] Here…

Complex Variables · Mathematics 2026-05-13 David Kalaj , Jian-Feng Zhu

An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. An IASI…

Combinatorics · Mathematics 2014-08-26 N. K. Sudev , K. A. Germina

Graph theory provides powerful tools for modeling concepts in number theory, leading to the introduction of graphs derived from arithmetic properties. One such structure is the divisor prime graph, $G_{Dp(n)}$. For any positive integer $n$,…

Combinatorics · Mathematics 2026-04-09 Purva J. Makadiya , Mahesh M. Jariya , Prashant J. Makadiya

Let $V$ be a linear representation of a connected complex reductive group $G$. Given a choice of character $\theta$ of $G$, Geometric Invariant Theory defines a locus $V^{ss}_\theta(G) \subseteq V$ of semistable points. We give necessary,…

Representation Theory · Mathematics 2025-10-07 Riku Kurama , Ruoxi Li , Henry Talbott , Rachel Webb

The Wiener index of a strong digraph $D$ is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not necessarily strong by defining the distance from a vertex $a$…

Combinatorics · Mathematics 2022-09-20 Peter Dankelmann

In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let $G=(V,E)$ be a primitive strongly regular graph with parameters $(v,k,\lambda,\mu)$. Let $S(G,H)$ be the graph from $G$ by switching with…

Combinatorics · Mathematics 2010-01-08 Hiroshi Nozaki

In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…

Optimization and Control · Mathematics 2023-04-19 Andrei Agrachev , Stefano Baranzini , Ivan Beschastnyi

The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…

Probability · Mathematics 2011-12-30 Oliver Knill

We construct a stratification of the punctual Hilbert scheme of points on a non-reduced and nodal plane curve, $x^uy^v=0$. Each stratum is indexed by a new combinatorial object we define: a weak diagonal partition. The approach is based on…

Algebraic Geometry · Mathematics 2026-04-07 Yuze Luan

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph which was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced. In this paper we study the F-index of four…

Discrete Mathematics · Computer Science 2016-11-23 Nilanjan De

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

Combinatorics · Mathematics 2012-08-24 Yair Caro , Adriana Hansberg

We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…

Functional Analysis · Mathematics 2018-01-30 Daniel Lenz , Marcel Schmidt , Peter Stollmann

In 2024, Gutman et al. \cite{I.Gutman 3} defined a new molecular descriptor called as The Euler-Sombor $(ES)$ index of graph. By using this index we define the Euler-Sombor $(ES)$ matrix of a graph $G$ whoes $(i,j)^{th}$ entry is…

Combinatorics · Mathematics 2025-02-13 Sopan Bansode , Sharad Barde , Ganesh Mundhe

Let $G$ be a cyclic $p$-group or generalized quaternion group, $X\in \pi_0 S_G$ be a virtual $G$-set, and $V$ be a fixed point free complex $G$-representation. Under conditions depending on the sizes of $G$, $X$, and $V$, we construct a…

Algebraic Topology · Mathematics 2025-03-21 William Balderrama , Yueshi Hou , Shangjie Zhang

An integer additive set-indexer is an injective function $f:V(G)\to 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \to 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which admits an IASI is…

Combinatorics · Mathematics 2015-04-13 N. K. Sudev , K. A. Germina

The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.

Machine Learning · Computer Science 2022-05-04 Rahul Sarkar

The distance $d(u,v)$ between the vertices $u$ and $v$ of a connected graph $G$ is defined as the number of edges in a minimal path connecting them. The \emph{transmission} of a vertex $v$ of $G$ is defined by $\sigma(v)=\sum\limits_{u\in…

Combinatorics · Mathematics 2018-09-18 Reza Sharafdini , Tamas Reti

The radial index of a 1-form on a singular set is a generalization of the classical Poincar\'e-Hopf index. We consider different classes of closed semi-analytic sets in R^n that contain 0 in their singular locus and we relate the radial…

Algebraic Geometry · Mathematics 2017-05-24 Nicolas Dutertre

By conformal welding, there is a pair of univalent functions $(f,g)$ associated to every point of the complex K\"ahler manifold $\Mob(S^1)\bk\Diff_+(S^1)$. For every integer $n\geq 1$, we generalize the definition of Faber polynomials to…

Mathematical Physics · Physics 2008-11-26 Lee-Peng Teo

The Wiener index of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers…

Combinatorics · Mathematics 2018-11-08 Zhongyuan Che , Karen L. Collins