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.
This is a function since it passes the vertical line test. It is impossible to draw a single vertical line to have it pass through more than one point on the curve.
The domain is the set of numbers x such that x is between -3 and +3 excluding those endpoints. In other words, the domain is -3 < x < 3. We never actually get to either endpoint because of the vertical asymptotes.
The range is the set of all real numbers. It is possible to get any output we want depending on the specific input.
Answer:
shade 10 boxes for 50%
Step-by-step explanation:
50%=50/100=1/2
1/2 of 20=10
:. To shade 50% of the boxes, 10 boxes need to be shaded
Answer:
What is the question
Step-by-step explanation:
