English
Related papers

Related papers: A graph theoretical Poincare-Hopf Theorem

200 papers

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-07-03 N K Sudev , K A Germina

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

Combinatorics · Mathematics 2019-11-05 Noga Alon , Dan Hefetz , Michael Krivelevich , Mykhaylo Tyomkyn

A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been…

Equivariant versions of the radial index and of the GSV-index of a vector field or a 1-form on a singular variety with an action of a finite group are defined. They have values in the Burnside ring of the group. Poincar\'e-Hopf type…

Algebraic Geometry · Mathematics 2013-07-09 Wolfgang Ebeling , Sabir M. Gusein-Zade

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

Combinatorics · Mathematics 2012-03-12 Brandon Humpert , Jeremy L. Martin

We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…

Combinatorics · Mathematics 2013-07-05 N. N. Davtyan , R. R. Kamalian

As we known, the {\it Seifert-Van Kampen theorem} handles fundamental groups of those topological spaces $X=U\cup V$ for open subsets $U, V\subset X$ such that $U\cap V$ is arcwise connected. In this paper, this theorem is generalized to…

General Mathematics · Mathematics 2010-06-22 Linfan Mao

Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index $SO$ of a graph $G$, and is defined by $$SO(G)=\sum_{uv\in E(G)}\sqrt{d_G(u)^2+d_G(v)^2},$$ where $d_G(v)$ is the degree of the vertex $v$ of $G$. In…

Combinatorics · Mathematics 2023-09-26 Batmend Horoldagva , Chunlei Xu

For any finite simple graph G=(V,E), the discrete Dirac operator D=d+d* and the Laplace-Beltrami operator L=d d* + d* d on the exterior algebra bundle Omega are finite v times v matrices, where dim(Omega) = v is the sum of the cardinalities…

Combinatorics · Mathematics 2013-01-09 Oliver Knill

Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…

Combinatorics · Mathematics 2017-10-06 Nilanjan De

It is shown that the Poincar\'e-Birkhoff fixed point theorem may be proven by extending the geometric approach originally devised by Henri Poincar\'e himself, along with several results from elementary differential topology. Beginning with…

Symplectic Geometry · Mathematics 2021-11-18 Andrew J. Graven , John H. Hubbard

We consider a realization of the real Grassmann manifold Gr(k,n) based on a particular flow defined by the corresponding (singular) solution of the KP equation. Then we show that the KP flow can provide an explicit and simple construction…

Algebraic Geometry · Mathematics 2010-11-10 Luis Casian , Yuji Kodama

The Wiener index of a finite graph G is the sum over all pairs (p, q) of vertices of G of the distance between p and q. When P is a finite poset, we define its Wiener index as the Wiener index of the graph of its Hasse diagram. In this…

Combinatorics · Mathematics 2023-04-14 Colin Defant , Valentin Féray , Philippe Nadeau , Nathan Williams

For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…

Combinatorics · Mathematics 2023-01-03 Projesh Nath Choudhury , Apoorva Khare

Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that $1.$ the (necessarily unique) smallest block graph with vertex set $V$ whose edge set contains $E$ is uniquely…

Combinatorics · Mathematics 2014-03-03 A. Dress , K. T. Huber , J. Koolen , V. Moulton , A. Spillner

The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set $Q\subseteq V$…

Social and Information Networks · Computer Science 2016-10-18 Natali Ruchansky , Francesco Bonchi , David Garcia-Soriano , Francesco Gullo , Nicolas Kourtellis

We study multivariate generalisations of the classical Wiener--Hopf algebra, which is the C$^*$-algebra generated by the Wiener--Hopf operators, given by the convolutions restricted to convex cones. By the work of Muhly and Renault, this…

Operator Algebras · Mathematics 2009-11-05 Alexander Alldridge , Troels Roussau Johansen

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

Geometric Topology · Mathematics 2017-12-12 Stavros Garoufalidis , Ezra Getzler

The Mayer-Vietoris theorem is known for its wide applications, especially in determining homology. In fact, this theorem provides us with a long exact sequence, where the underlying homology groups fit in. However, this theorem does not…

Combinatorics · Mathematics 2026-03-16 Sajal Mukherjee , Pritam Chandra Pramanik , Arundhati Rakshit

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…

Combinatorics · Mathematics 2015-10-06 Tsai-Lien Wong , Xuding Zhu
‹ Prev 1 3 4 5 6 7 10 Next ›