Computer Science, asked by muthavarapuparameswa, 4 months ago

Draw the complete undirected graphs on one, two, three, four and five
vertices. Prove that the number of edges in an n vertex complete graph is n(n-1)/2.
Sort the following list using Quick Sort technique, displaying each step. 20, 12, 25 6, 10, 15, 13 full explanation​

Answers

Answered by chintamanbhamre000
1

Answer:

Given N number of vertices of a Graph. The task is to find the total number of edges possible in a complete graph of N vertices.

Complete Graph: A Complete Graph is a graph in which every pair of vertices is connected by an edge.

Examples:

Input : N = 3

Output : Edges = 3

Input : N = 5

Output : Edges = 10

Similar questions