Degree Sequences and Constructing Graphs from Graphic Sequences
Definition of Degree
The degree of a vertex (v) in a graph (G), denoted by (d_G(v)), is the number of edges of (G) incident with (v), with each loop counting as two edges. (J.A. Bondy, Graph Theory)
Two fundamental results follow from this definition:
Handshaking Theorem: For any graph (G),
[
\sum_{v \in V} d(v) = 2m
]
where (m) is the number ...
Posted on Fri, 15 May 2026 05:38:38 +0000 by btubalinal