Search for question
Question

1. A directed graph is strongly connected if there is a (directed)path from every node to every other node. Show that in a directed strongly connected graph containing more than one node, no node can have a zero in degree or a zero out degree.

Fig: 1