Which of the following statements is false or true? 1. If an undirected simple graph of n
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 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
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Data Structures Using C A Practical Approach For Beginners
ISBN: 9781000470741
1st Edition
Authors: Amol M Jagtap, Ajit S Mali
Question Posted: