Definition:Euler Characteristic of Finite Graph

From ProofWiki
Jump to navigation Jump to search


This page has been identified as a candidate for refactoring of basic complexity.
In particular: After amending general formula, transclude it
Until this has been finished, please leave {{Refactor}} in the code.

New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only.

Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{Refactor}} from the code.


Definition

Let $X = \struct {V, E}$ be a graph.

Let $X$ be embedded in a surface.


The Euler characteristic of $X$ is written $\map \chi X$ and is defined as:

$\map \chi x = v - e + f$

where:

$v = \size V$ is the number of vertices
$e = \size E$ is the number of edges
$f$ is the number of faces.


Generalized Formula


This definition needs to be completed.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding or completing the definition.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{DefinitionWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.



Also see


Source of Name

This entry was named for Leonhard Paul Euler.


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Euler_Characteristic_of_Finite_Graph&oldid=593993"