Scribd
Upload
133 views

Null 1

The document is a tutorial on graphs and trees that contains 13 questions covering various graph topics like determining if graphs are regular or bipartite, finding vertex and edge connectivity, determining if graphs have Euler or Hamiltonian paths/circuits, graph isomorphism, graph coloring, and finding minimum spanning trees using Kruskal's and Prim's algorithms.

Uploaded by

Srajan Solanki
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
133 views

Null 1

The document is a tutorial on graphs and trees that contains 13 questions covering various graph topics like determining if graphs are regular or bipartite, finding vertex and edge connectivity, determining if graphs have Euler or Hamiltonian paths/circuits, graph isomorphism, graph coloring, and finding minimum spanning trees using Kruskal's and Prim's algorithms.

Uploaded by

Srajan Solanki
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Unit 5 Graphs and Trees Tutorials

Tutorial : Graphs, Paths, connectivity

1. Can a graph exist with 15 vertices each of degree five?


2. Is it possible to draw a simple graph with 4 vertices and 7 edges? (Ans: No)
3. Give an example of a graph that is regular, but not complete, with each vertex having degree
three.
4. How many vertices does a regular graph of degree four with 10 edges have?
5. Draw the subgraph induced by {a, b, c, e}

6. Determine which of the following graphs are bipartite and which are not.

7. Prove that a graph which contains a triangle can not be bipartite.


8. Find the vertex connectivity of the following graphs

(Ans: 2,3)

Page |1
Unit 5 Graphs and Trees Tutorials

9. Find the edge connectivity of the following graphs

(Ans: 3,3)

10. Does the following graph have an Euler path/ Euler circuit. Give the Euler path/ Euler circuit if it
exists.

(Ans: Graph 1: Euler Circuit does not exist. Path exists.


Graph 2: Euler Circuit does not exist. Path exists.
Graph 3: Euler circuit exists.)
11. Does the following graph have a Hamiltonian path/ Hamiltonian Circuit.

(Ans: Graph6: Hamiltonian Circuit exists.

Page |2
Unit 5 Graphs and Trees Tutorials

Graph7: Hamiltonian Circuit exists.


Graph 8: No Hamiltonian Circuit but path exists.
Graph9: Hamiltonian Circuit exists.)
12. Give an example of a graph that has no Eulerian circuit and has a Hamiltonian circuit.
13. Give an example of a graph that has neither Euler circuit nor Hamiltonian circuit.

Page |3
Unit 5 Graphs and Trees Tutorials

Tutorial : Isomorphism and Graph Coloring


1. Indicate whether the two graphs shown below are isomorphic.

(Ans: No)
2. Indicate whether the two graphs shown below are isomorphic and justify your answer.

(Ans: Yes)
3. Show that the two graphs are isomorphic.

4. Which of the graphs shown below are isomorphic?

Page |4
Unit 5 Graphs and Trees Tutorials

5. Show that the following graphs are isomorphic.

6. Find the chromatic number of the following graphs:


i) ii)

iii) iv)

7. Find the edge chromatic number of the following graphs:


i) ii)

Page |5
Unit 5 Graphs and Trees Tutorials

iii)

8. Schedule the final exams for Math 115, Math 116, Math 185, Math 195, CS 101, CS 102, CS 273,
and CS 473, using the fewest number of different time slots, if there are no students taking both
Math 115 and CS 473, both Math 116 and CS 473, both Math 195 and CS 101, both Math 195
and CS 102, both Math 115 and Math 116, both Math 115 and Math 185, and both Math 185 and
Math 195, but there are students in every other pair of courses
9. Find MST following networks using Krushkal’s algorithm
i) ii)

10. Find MST networks of ex. 9 using Prim’s algorithm

Page |6

You might also like