algorithm - Graph theory: Are DFS forests that correspond to a graph isomorphic? -
for graph g, may have many different dfs forests if select different starting vertex or choose different unexplored edges. can construct many auxiliary graphs of g . whether auxiliary graphs of g isomorphic each other? justify answer.
i know mean graph isomorphic don't know how prove right or can't think of counter example
please help
no not isomorphic :
consider following graph :
the following 2 dfs forests belong while aren't isomorphic :
Comments
Post a Comment