A common source graph is a undirected graph G = (V, E) where…
A common source graph is a undirected graph G = (V, E) where for any two vertices u, v, there exists a vertex w (not necessarily distinct from u, v) such that there is a path from w to u and a path from w to v. T/F: A graph is a common source graph if and only if it contains a tree as a subgraph.