The node removal of which makes a graph disconnected is called: - (i) — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2023 paper

Module 4: Graph and Tree Algorithms

20232m

The node removal of which makes a graph disconnected is called:

(i) Pendant vertex
(ii) Bridge
(iii) Articulation point
(iv) Coloured vertex

Search Google Ask AI

Similar questions

Discrete MathematicsA graph which consists of disjoint union of trees is called (i) bipartite graph (ii) forest (iii) caterpillar tree (iv) labelled tree20222m Artificial intelligenceGraph used to represent semantic network is (i) undirected graph (ii) directed graph (iii) directed acyclic graph (DAG) (iv) directed complete graph20222m Computer Networks______ refers to the physical or logical arrangement of a network. (i) Topology (ii) Mode of operation (iii) Data flow (iv) None of the above20202m Computer NetworksWhat is bridge? Explain about spanning tree.20158m

PreviousWhich of the following standard algorithms is not a greedy algorithm? - (i) Dijkstra's shortest path algorithm - (ii) Kruskal algorithm - (iii) Bellman ford shortest path algorithm - (iv) Prim's algorithm NextDiscuss the average, worst, and best time complexity of the algorithm. Give suitable examples.