Papers
Topics
Authors
Recent
Search
2000 character limit reached

The theorems of Green-Stokes,Gauss-Bonnet and Poincare-Hopf in Graph Theory

Published 29 Jan 2012 in math.DG and cs.DM | (1201.6049v1)

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.

Authors (1)
Citations (16)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up