Answer:
A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with graph vertices is denoted and has (the triangular numbers) undirected edges, where is a binomial coefficient. In older literature, complete graphs are sometimes called universal graphs.
Step-by-step explanation:
The answer u are looking for is 30
Answer:
I ain't sure but I guess it's option B .
