The theorems of Green-Stokes,Gauss-Bonnet and Poincare-Hopf in Graph Theory
classification
🧮 math.DG
cs.DM
keywords
graphgauss-bonnetgreen-stokespoincare-hopftheoreticalcorediscreteexposition
read the original abstract
By proving graph theoretical versions of Green-Stokes, Gauss-Bonnet and Poincare-Hopf, core ideas of undergraduate mathematics can be illustrated in a simple graph theoretical setting. In this pedagogical exposition we present the main proofs on a single page and add illustrations. While discrete Stokes is is old, the other two results for graphs were found only recently.
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.