Register

NIELIT 2017 July Scientist B (IT) - Section B: 6

• edited by
972 views

1 Answer

Best answer
3 votes
3 votes
  • A bridge ,cut-edge, or cut arc is an edge of a graph whose deletion increases its number of connected components.
  • Equivalently, an edge is a bridge if and only if it is not contained in any cycle. 
  • The removal of edges (a,b) and (e,f) makes graph disconnected.

 

option A

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
4 answers
1
admin asked Mar 30, 2020
1,448 views
NIELIT 2017 July Scientist B (CS) - Section B: 11
Consider the following graph $L$ and find the bridges,if any. No bridge $\{d,e\}$ $\{c,d\}$ $\{c,d\}$ and $\{c,f\}$
Consider the following graph $L$ and find the bridges,if any.No bridge$\{d,e\}$$\{c,d\}$$\{c,d\}$ and $\{c,f\}$
User Avatar
0 votes
0 votes
1 answer
2
admin asked Mar 30, 2020
9,946 views
NIELIT 2017 July Scientist B (IT) - Section B: 1
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is $E$ $2E$ $V$ $2V$
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is$E$$2E$$V$$2V$
User Avatar
0 votes
0 votes
1 answer
4
admin asked Mar 30, 2020
2,080 views
NIELIT 2017 July Scientist B (IT) - Section B: 3
A path in graph $G$, which contains every vertex of $G$ and only once? Euler circuit Hamiltonian path Euler Path Hamiltonian Circuit
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
User Avatar
Link Copied!