Connected graphs known by existence of path between every pair of vertices - Data Structure

Q.  Which graphs are distinctively known by the existence of a path between every pair of its vertices?
- Published on 27 Aug 15

a. Weighted graphs
b. Connected graphs
c. Subgraphs
d. Multigraphs

ANSWER: Connected graphs

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 21 Nov 15
    Connected graph are distinctively known by the existence of a path between every pair of its vertices.
    A graph is called strongly connected , if for any pair of vertices U and V, there exist a path from U to V and vice versa.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲