Question 86
An undirected graph G has 15 vertices and 20 edges. What is the sum of the degrees of all vertices in G?
Sum of degrees = 2 * |E| = 2 * 20 = 40.
An undirected graph G has 15 vertices and 20 edges. What is the sum of the degrees of all vertices in G?
Sum of degrees = 2 * |E| = 2 * 20 = 40.
Calculate the total number of edges in a complete undirected graph $K_{8}$ with 8 vertices.
$Edges = n * (n - 1) / 2 = 8 * 7 / 2 = 28.$
How many distinct spanning trees can be formed from a complete labeled graph $K_{5}$ (using Cayley's Formula)?
$Cayley's Formula = n^{n-2} = 5^{5-2} = 5^3 = 125.$
A simple undirected connected planar graph has 10 vertices and 15 edges. How many faces (regions) does it divide the plane into?
$Euler's formula: V - E + F = 2 => 10 - 15 + F = 2 => -5 + F = 2 => F = 7.$
What is the maximum number of edges in a simple bipartite graph with 12 vertices?
Max edges in bipartite graph with 12 vertices = (12/2) * (12/2) = 6 * 6 = 36.