# Directed Graphs and Trees

A. Is a directed graph weakly connected if there is a path from a to b and from b to a

whenever a and b are vertices in the graph?

b. If two trees have the same number of vertices and the same degrees, are the two trees

isomorphic?

https://brainmass.com/math/graphs-and-functions/directed-graphs-trees-24262

#### Solution Preview

a. Is a directed graph weakly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph?

A graph is ...

#### Solution Summary

Directed graphs and connectedness and isomorphic trees are discussed. The solution is concise.

$2.19