A simple graph G has |v|=8 and |E|=12, find number of edges in |E(Gc)|?
A simple graph G has |v|=8 and |E|=12, find number of edges in |E(Gc)|?
Answer: 16 — Key fact: In a simple graph with n vertices, the maximum possible number of edges is n(n-1)/2. Step 1: Compute the maximum number of edges for 8 vertices.…
Attempted by 44 students.
Show answer & explanation
Correct answer: 16
Key fact: In a simple graph with n vertices, the maximum possible number of edges is n(n-1)/2.
Step 1: Compute the maximum number of edges for 8 vertices.
Maximum edges = 8 × 7 / 2 = 28.
Step 2: The complement of the given graph has all edges that are not present in the original graph.
Step 3: Subtract the number of edges in the original graph from the maximum.
Complement edges = 28 − 12 = 16.
Final answer: The complement graph has 16 edges.
Loading lesson…