pith. sign in

arxiv: 1201.1162 · v1 · pith:JBE43R36new · submitted 2012-01-05 · 🧮 math.DG · cs.CG· cs.DM· math.GN

A graph theoretical Poincare-Hopf Theorem

classification 🧮 math.DG cs.CGcs.DMmath.GN
keywords graphdiscretepoincare-hopftheoremallowsalwaysbecomecharacteristic
0
0 comments X
read the original abstract

We introduce the index i(v) = 1 - X(S(v)) for critical points of a locally injective function f on the vertex set V of a simple graph G=(V,E). Here S(v) = {w in E | (v,w) in E, f(w)-f(v)<0} is the subgraph of the unit sphere at v in G. It is the exit set of the gradient vector field. We prove that the sum of i(v) over V is always is equal to the Euler characteristic X(G) of the graph G. This is a discrete Poincare-Hopf theorem in a discrete Morse setting. It allows to compute X(G) for large graphs for which other methods become impractical.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The energy of a simplicial complex

    math.CO 2019-07 unverdicted novelty 5.0

    The sum of entries in the inverse of the intersection matrix of a simplicial complex equals its Euler characteristic, and so does the difference between the numbers of positive and negative eigenvalues of that matrix.