Computer Sciences > Gate 2016 Set-2 > Graph Theory
Consider a set U of 23 different compounds in a Chemistry lab. There is a subset S of U of 9 compounds, each of which reacts with exactly 3 compounds of U. Consider the following statements:
I. Each compound in U S reacts with an odd number of compounds.
II. At least one compound in U S reacts with an odd number of compounds.
III. Each compound in U S reacts with an even number of compounds.
Which one of the above statements is ALWAYS TRUE?
I. Each compound in U S reacts with an odd number of compounds.
II. At least one compound in U S reacts with an odd number of compounds.
III. Each compound in U S reacts with an even number of compounds.
Which one of the above statements is ALWAYS TRUE?
Correct : Graph Theory
Similar Questions
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
Total Unique Visitors
Loading......