Topics: Graph Theory
(lemma)
If a graph with no loops has edges and vertices, then the sum of its vertices’ degrees is twice the number of edges.
That is:
Search
Topics: Graph Theory
(lemma)
If a graph with no loops has e edges and n vertices, then the sum of its vertices’ degrees is twice the number of edges.
That is: