A travel agency offers different getaways to New York. Plan A includes hotel accommodations for 3-nights and 2-pairs of baseball
1 answer:
You might be interested in
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.
Answer:
d(x) = √[(x - 2)² + (3x - 1)²]
Step-by-step explanation:
The distance between two points with coordinates (x₁, y₁) and (x₂, y₂) is given as
d = √[(x₂ - x₁)² + (y₂ - y₁)²]
So, the distance between point (2,0) and a point (x,y)
d = √[(x - 2)² + (y - 0)²]
d = √[(x - 2)² + (y)²]
But the point (x,y) is on the line y = 3x - 1
We can substitute for y in the distance between points equation.
d(x) = √[(x - 2)² + (3x - 1)²]
QED!
