Tutorial on graphs and trees

1. Find the shortest path from source ‘C’, ‘a’ resp. for all vertices in Graph shown below.

Source

source a

2. From the above for last two graphs find out respective minimum spanning trees using both
prim’s and kruskal’s method.

3. Which or of the following graphs are isomorphic to each other, which is not isomorphic.
i.
 ii.

iii.

4. Which of the following graphs are planar graphs. For planar graph draw the graph without
crossing the edges, also find the chromatic number for assigning graph coloring to graphs.
i. ii. iii.

5. For above graphs in (Q.4.) find out BFS and DFS trees to find bredth and depth of vertex a

6. Determine which of the following has euler ciruit, euler path. Write the euler paths and circuits,
if possible.
i. ii.
7. Determine which of the following has Hamilton circuit and path. Mention if any, and how many
possible.
i. ii.