For which of the following combinations of the degrees of vertices wou – McqOptions

MCQOPTIONS

1.	For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
A.	1,2,3
B.	2,3,4
C.	2,4,5
D.	1,3,5
Answer» B. 2,3,4

Discussion

No Comment Found

Related MCQs

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?