Question: Which of the following statements is false or true? 1. If an undirected simple graph of n vertices consists of n (n-1)/2 number of edges

Which of the following statements is false or true?

1. If an undirected simple graph of ā€˜n’ vertices consists of n (n-1)/2 number of edges then it is called a complete graph.

2. A simple digraph is said to be unilaterally connected if for any pair of nodes of a graph at least one of the nodes of a pair is reachable from the other node.

A. Statement 1 is false

B. Statement 2 is false

C. Statements 1 and 2 are false

D. Statements 1 and 2 are true

Step by Step Solution

3.39 Rating (161 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures and Other Objects Using Java Questions!