Question
(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n-1) edges
(iv) G has n edges
a.
(i) and (ii)
b.
(i) and (iii)
c.
(i) and (iv)
d.
(ii) and (iii)
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which two of the following are equivalent for an undirected graph G? (i) G is a tree (ii) There is at least one path between any two distinct vertices of G (iii) G contains no...
Similar Questions
Discover Related MCQs
Q. A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. This relation is:
View solution
Q. The set of positive integers under the operation of ordinary multiplication is:
View solution
Q. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by:
View solution
Q. A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two are green?
View solution
Q. The number of edges in a complete graph with ‘n’ vertices is equal to:
View solution
Q. Depth ion travels of the following directed graph is:
View solution
Q. If (a^2−b^2) is a prime number where a and bϵN, then:
View solution
Q. For a complete graph with N vertices, the total number of spanning trees is given by:
View solution
Q. Let A and B be two arbitrary events, then:
View solution
Q. Consider the relation on the set of non-negative integers defined by x≡y if and only if:
View solution
Q. Minimum number of individual shoes to be picked up from a dark room (containing 10 pair of shoes) if we have to get atleast one proper pair:
View solution
Q. If f(x) =x+1 and g(x)=x+3 then fofofof is:
View solution
Q. If Im denotes the set of integers modulo m, then the following are fields with respect to the operations of addition modulo m and multiplication modulo m:
(i) Z23 (ii) Z29
(iii) Z31 (iv) Z33
View solution
Q. In mathematical logic, which of the following are statements?
(i) There will be snow in January.
(ii) What is the time now?
(iii) Today is Sunday.
(iv) You must study Discrete mathematics
View solution
Q. Match the List-I with List-II and choose the correct answer from the code given below:
List I List II
(a) Equivalence (i) p⇒q
(b) Contrapositive (ii) p⇒q : q⇒p
(c) Converse (iii) p⇒q : ∼q⇒∼p
(d) Implication (iv) p⇔q
View solution
Q. A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls will be red and two will be green?
View solution
Q. A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train and Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows:
Bus 30 people; Train 35 people; Automobile 100 people; Bus and Train 15 people; Bus and Automobile 15 people; Train and Automobile 20 people; and all the three methods 5 people. How many people completed the survey form?
View solution
Q. If a graph (G) has no loops or parallel edges, and if the number of vertices (n) in the graph is n≥3, then graph G is Hamiltonian if
(i) deg(v) ≥ n/3 for each vertex v
(ii) deg(v) + deg(w) ≥ n whenever v and w are not connected by an edge
(iii) E(G) ≥ 1/3(n−1)(n−2)+2
View solution
Q. Consider two sequences X and Y:
X = <0,1,2,1,3,0,1>
Y = <1,3,2,0,1,0>
The length of longest common subsequence between X and Y is
View solution
Q. Consider the following terminology and match List I with List II and choose the correct answer from the code given below.
b = branching factor
d = depth of the shallowest solution
m = maximum depth of the search tree
l = depth limit
List I List II
(Algorithms) (Space Complexity)
(a) BFS search (i) O(bd)
(b) DFS search (ii) O(b^d)
(c) Depth-limited search (iii) O(bm)
(d) Iterative deepening search (iv) O(bl)
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Structures? 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!