Essential Graph Theory Formulas and Concepts
Posted by Anonymous and classified in Mathematics
Written on in
English with a size of 4.68 KB
Handshaking Lemma
In any undirected graph, the sum of the degrees of all vertices is twice the number of edges.
Formula: Σdeg(v) = 2|E|
Euler's Formula for Planar Graphs
For planar graphs, the relationship between vertices (V), edges (E), and regions (R) is defined as:
V - E + R = 2
Sum of Degrees and Odd Vertices
The sum of the degrees of all vertices in any graph is always even because each edge contributes 2 to the total sum. Furthermore, the number of vertices with an odd degree must always be even.
Graphs with No Odd Degree Vertices
If all vertices in a graph have an even degree, the graph is Eulerian, meaning it contains an Eulerian circuit.
Complete Graphs
A complete graph with n vertices, denoted as Kn, has an edge between every pair of distinct... Continue reading "Essential Graph Theory Formulas and Concepts" »