The number of distinct simple graphs with up to three nodes is
- A. 15
- B. 10
- C. 7
- D. 9
Answer: C. 7
Explanation: For n=1: 1 graph. n=2: 2 graphs (0 or 1 edge). n=3: 4 graphs (0, 1, 2, 3 edges). Total = 1 + 2 + 4 = 7.
All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2008
The number of distinct simple graphs with up to three nodes is
Answer: C. 7
Explanation: For n=1: 1 graph. n=2: 2 graphs (0 or 1 edge). n=3: 4 graphs (0, 1, 2, 3 edges). Total = 1 + 2 + 4 = 7.
Previous question | Next question | All questions of ISRO Computer Science (CSE) 2008