Question

A complete graph contains 10 nodes. What is the total number of edges in the graph?​

Answer 1

Explanation:

The total number of edges in the above complete graph = 10 = (5)*(5-1)/2.

Answer 2

Answer: 45

Explanation:

Graphs in data structures are used to represent relationships between objects. Each graph consists of a set of points known as vertices or nodes connected by lines known as edges

The level of a node is the number of edges along the unique path between the node and the root node.

Nodes represent different entities (e.g. proteins or genes in biological networks) and edges convey information about the connections between nodes.

A node is an intersection/connection within a data communication network. In an environment where all devices are accessible through a network, all these devices are considered nodes

Each of the n nodes has n−1 edges emanating from it. However, n(n−1) counts each edge twice. So the final answer is that a graph with n nodes contains n(n−1)/2 edges in the graph.

Hence here n is 10

∴$n(n-1)/2=10(10-1)/2$

On solving we get $n=45$

#SPJ5