MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
In a finite graph the number of vertices of odd d..
1.
In a finite graph the number of vertices of odd degree is always ______
A.
even
B.
odd
C.
even or odd
D.
infinite
Answer» B. odd
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible value of n is ___________
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?
In a finite graph the number of vertices of odd degree is always ______
Degree of a graph with 12 vertices is _______
A simple graph can have _______
Disconnected components can be created in case of ___________
What is a complete digraph?
The graph representing universal relation is called _______
Let, D = <A, R> be a directed graph or digraph,then D’ = <A’, R’> is a subgraph if ___________
A directed graph or digraph can have directed cycle in which ______
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply