Computer-Networks
November 12, 2023OOPS
November 12, 2023UGC NET CS 2009 Dec-Paper-2
|
Question 2
|
Circle has ____________
|
No vertices
|
|
|
Only 1 vertex
|
|
|
∞ vertices
|
|
|
None of these
|
Question 2 Explanation:
In graph theory, a circle graph is the intersection graph of a set of chords of a circle.
→ A circle graph is an undirected graph whose vertices can be associated with chords of a circle such that two vertices are adjacent if and only if the corresponding chords cross each other.
→ Circle does not have vertices.
→ A circle graph is an undirected graph whose vertices can be associated with chords of a circle such that two vertices are adjacent if and only if the corresponding chords cross each other.
→ Circle does not have vertices.
Correct Answer: A
Question 2 Explanation:
In graph theory, a circle graph is the intersection graph of a set of chords of a circle.
→ A circle graph is an undirected graph whose vertices can be associated with chords of a circle such that two vertices are adjacent if and only if the corresponding chords cross each other.
→ Circle does not have vertices.
→ A circle graph is an undirected graph whose vertices can be associated with chords of a circle such that two vertices are adjacent if and only if the corresponding chords cross each other.
→ Circle does not have vertices.