How many edges must be removed from the wheel graph w6 in order to create a spanning tree for the graph?
a) 5
b) 6
c) 7
d) the graph does not have a spanning tree.

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.

5/6

step-by-step explanation:

if i remember correctly with perpendicular stuff you just take away the negative

1/3

step-by-step explanation:

to find this, you can divide 12 by 4 which is 3 or you can multiply 4 until you reach 12 (4x3=12). both should give you 3, meaning theres three times less bananas than there are oranges.