We give some basic definitions with examples of three types of connectedness. We discuss the conditions under which one can direct the edges of a graph in such a way that the resulting digraph is strongly connected. Ref: Frank Harary, Graph Theory
No download links available.
