ICT
August 17, 2024ISRO-2007
August 18, 2024ISRO-2007
| Question 6 |
A graph with n vertices and n-1 edges that is not a tree, is
| Connected | |
| Disconnected | |
| Euler | |
| A circuit |
Question 6 Explanation:
Consider a graph with two nodes(n1&n2) and number of edges are 1, There may be chance self edge with node n1 then graph is disconnected.
Consider the graph with three nodes(n1,n2&n3) and has 2 edges.
n1–>n2 and n2—>n1 then the graph is disconnected.
Consider the graph with three nodes(n1,n2&n3) and has 2 edges.
n1–>n2 and n2—>n1 then the graph is disconnected.
Correct Answer: B
Question 6 Explanation:
Consider a graph with two nodes(n1&n2) and number of edges are 1, There may be chance self edge with node n1 then graph is disconnected.
Consider the graph with three nodes(n1,n2&n3) and has 2 edges.
n1–>n2 and n2—>n1 then the graph is disconnected.
Consider the graph with three nodes(n1,n2&n3) and has 2 edges.
n1–>n2 and n2—>n1 then the graph is disconnected.
Subscribe
Login
0 Comments