1. Other
  2. Other
  3. graph theory...

Question: graph theory...

Question details

Graph Theory

Q2) For different classes of graphs, we need to use a different definition of isomorphism. Consider the class of simple digraphs. Two directed simple graphs G, H are iso- morphic if and only if there is a bijection f : V(G) → V(H) such that there is a directed edge (u. v) E E(G) if and only if there is the corresponding directed edge Two of the digraphs below are isomorphic. Which two are t your reasoning. hey? Inlinnally explain Q3) Consider the dodecahedral graph (two drawings given): 800 Find (a) a trail of length 5, (b) a path of length 10, (c) cycles of length 5,8, and 9, and (d) cutsets with three, four,and five edges

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution