Bissoy.com
Doctors Medicines MCQs Q&A

In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true? Correct Answer A bridge cannot be part of a simple cycle

(A) FALSE:

e.g. [ src="//storage.googleapis.com/tb-img/production/17/03/ya27.JPG" style="height:7px; width:97px">

The only edge in the above tree is bridge.

(B) TRUE:

If an edge is the part of the cycle than its removal will not disconnect the graph.

(C) FALSE:

e.g. [ alt="y28" src="//storage.googleapis.com/tb-img/production/17/03/y28.JPG">

Here no edge of the clique is a bridge

(D) FALSE:

e.g. [ alt="y29" src="//storage.googleapis.com/tb-img/production/17/03/y29.JPG">

Related Questions

When we compare the half bridge converter and full bridge converter 1. The maximum collector current of a full bridge is only double that of the half bridge 2. Full bridge uses 4-power switches instead of 2, as in the double bridge. 3. Output power of a full bridge is twice that of a half bridge with the same input voltage and current. When of the above statements are correct?
The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Which of the following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only
Let G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to TD. (A cross edge in G is between two nodes neither of which is an ancestor of the other in TD .) (II) For every edge (u, v) of if u is at depth i and v is at depth j in TB , then |? − ?| = 1. Which of the statements above must necessarily be true?
Four friends A, B, C and D need to cross a bridge. A maximum two persons can cross it at a time. It is night and they just have one lamp. Persons that cross the bridge must carry the lamp to find the way. A pair must walk together at the speed of slower person. After crossing the bridge, the person having faster speed in the pair will return with the lamp each time to accompany another person in the group. Finally, the lamp has to be returned at the original place and the person who returns the lamp has to cross the bridge again without lamp. To cross the bridge, the time taken by them is as follows: A :1 minute, B : 2 minutes, C : 7 minutes and D : 10 minutes. What is the total minimum time required by all the friends to cross the bridge?
A boat is on the one side of a bridge and the other boat is on the other side of the bridge. The bridge is 36 meter above the river surface. The angles of depression of both the boats from the bridge point on the bridge are complementary to each other and the angle of depression of first boat from the bridge is tan-1(1/3), then what is the distance between both the boats?
A cow was standing on a bridge, 5m away from the middle of the bridge. A train was coming towards the bridge from the ends nearest to the cow. Seeing this cow ran towards the the train and managed to escape when the train was 2m away from bridge. If it had run in the opposite direction, it would hit by the train 2m before the end of the bridge. What is the lenght of the bridge in meters assuming the speed of the train is 4 times that of cow ?
G = (V, E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? I. If e is the lightest edge of some cycle in G, then every MST of G includes e II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e 
Which of the following statements are true about edge dislocations?
P. Edge dislocations do not have an extra half plane associated with them.
Q. The Burger vectors is perpendicular to the direction.
R. Edge dislocations can avoid obstacles by cross-slip.
S. Depending on geometry, parallel edge dislocations of opposite signs can attract or repel one another.
Let G be an undirected connected graph with distinct edge weights . Let emax be the edge with maximum weight and emin be the edge with minimum weight. Which of the following statements is false.