Question
a.
the degree of each vertex is at most n/2
b.
the degree of each vertex is equal to n
c.
the degree of every vertex is at least n+1/2
d.
the degree of every vertex in G is at least n/2
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________
Similar Questions
Discover Related MCQs
Q. What is a separable graph?
View solution
Q. How many edges are there in a complete graph of order 9?
View solution
Q. How many cycles are there in a wheel graph of order 5?
View solution
Q. The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________
View solution
Q. The time complexity to find shortest distances by using Dijkstra’s algorithm is __________
View solution
Q. Topological sorting of a graph represents _______ of a graph.
View solution
Q. In preorder traversal of a binary tree the second step is ____________
View solution
Q. An important application of binary tree is ______
View solution
Q. From the following code identify the which traversal of a binary tree is this __________
//if node has left child
order(node.left)
//if node has right child
order(node.right)
visit(node)
View solution
Q. What is the minimum height for a binary search tree with 60 nodes?
View solution
Q. From the following code identify the which traversal of a binary tree is this __________
function traversal(node)
{
//Input:root node of the tree
//Output:None
visitLeft(node)
//if node has left child
traversal(node.left)
visit_Below(node)
//if node has right child
traversal(node.right)
visitRight(node)
}
View solution
Q. For the expression (7-(4*5))+(9/3) which of the following is the post order tree traversal?
View solution
Q. The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________
View solution
Q. An immediate application of a Depth First Search traversal is __________
View solution
Q. Breadth First Search traversal of a binary tree finds its application in __________
View solution
Q. Worst case complexity of Breadth First Search traversal __________
View solution
Q. Evaluation of expression a/b+c*d-e in postfix notation.
View solution
Q. Evaluation of 4*5+3/2-9 in prefix notation.
View solution
Q. What is the output of the following if funct1(7)?
View solution
Q. Infix to prefix conversion can be done using __________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
