MathGloss

The Euler characteristic of a graph is the difference $V-E$ between the number of vertices and the number of edges.

Wikidata ID: Q852973