Q32.
Question
Suppose a graph has vertices and each pair of vertices is connected by exactly one edge. Find the number of edges in the graph. (Hint: If you use the Fundamental Counting Principle, be sure to count each edge only once.)
Step-by-Step Solution
Verified Answer
There are total edges
1Step 1. Given information
A graph with 26 vertices is given
2Step 2. Concept used
First find the total number of ways to draw an edge. Then divide it by two because each vertex is counted two times.
3Step 3. Calculation
Total number of ways to draw an edge is-
Now divide it by two,
Other exercises in this chapter
Q30.
How many numbers between 100 and 999, inclusive, have 7 in the tens place?90100110120
View solution Q31.
A coin is tossed four times. How many possible sequences of heads or tails are possible?481632
View solution Q33.
TRANSPORTATIONThe table shows the distances in miles of the roads between some towns. Draw a graph in which the vertices represent the towns and the edges are l
View solution Q34.
Prove that 4+7+10+...+3n+1=n3n+52 for all positive integers n.
View solution