How many edges must be removed from the wheel graph W6 in order to create a spanning tree for the graph?
1 answer:
Answer:
The correct option is A.
Step-by-step explanation:
If a graph is formed by connecting a single universal vertex to all vertices of a cycle, then it is known as wheel graph.
W₆ means wheel graph having 6 vertices as shown in the below figure.
Total number of edges in a wheel graph is 2(n-1), where n is number of vertices. So, the number of edges in W₆ is
In a spanning tree all the vertices covered with minimum possible number of edges. Total number of edges in a spanning tree is (n-1).
Total number of edges in a spanning tree which has 6 vertices is
The number of edges we need to remove is
Therefore the correct option is A.
You might be interested in
The set that represents the same relation as the graph given is: B. (-5, 4), (-3, -2), (-1, -2), (2, 0), (3, 3), (4, 5), (6, -4).
<h3>What is a Relation?</h3>
A relation is defined as a relationship between the input and output, which can be displayed on a graph on a coordinate plane.
From the graph as shown in the image attached below,
The set that has the same coordinate points as indicated on the graph is:
B. (-5, 4), (-3, -2), (-1, -2), (2, 0), (3, 3), (4, 5), (6, -4).
Learn more about relation on:
#SPJ1
