Equivalence of Vertices

by Kosovo Buda   Last Updated September 17, 2019 22:20 PM

A directed graph D is strongly connected if and only if each vertex pair is equivalent. Show that this is indeed an equivalence relation on the vertex set of D and that each equivalence class (which is a vertex set of D) induces a subgraph of D which is strongly connected.

It is not clear form me about What do we mean by the equivalence of vertices of G? any help

Related Questions

Updated May 16, 2017 04:20 AM

Updated March 07, 2017 18:20 PM

Updated March 15, 2019 03:20 AM

Updated March 27, 2019 17:20 PM

Updated April 22, 2018 02:20 AM