Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
129 views

Module-5 Fundamentals of Graphs Tutorial Sheet

This tutorial sheet covers fundamental concepts in graph theory including: 1. Conditions for when a graph can or cannot have a certain number of vertices and edges. 2. Properties of complete graphs such as the number of edges in Kn. 3. Conditions for when a graph contains a cycle or Eulerian/Hamiltonian paths. 4. Representing graphs using matrices and determining graph properties from the matrices. 5. Examples of graph concepts including isomorphism, components, shortest paths.

Uploaded by

Kshitiz Goyal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
129 views

Module-5 Fundamentals of Graphs Tutorial Sheet

This tutorial sheet covers fundamental concepts in graph theory including: 1. Conditions for when a graph can or cannot have a certain number of vertices and edges. 2. Properties of complete graphs such as the number of edges in Kn. 3. Conditions for when a graph contains a cycle or Eulerian/Hamiltonian paths. 4. Representing graphs using matrices and determining graph properties from the matrices. 5. Examples of graph concepts including isomorphism, components, shortest paths.

Uploaded by

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

Tutorial sheet on Module:5 Fundamentals of Graphs

1. Can a simple graph have 5 vertices and 12 edges? If so, draw it; if not, explain why it is not possible
to have such a graph.

2. How many edges are there in a complete graph with n vertices.


3. Prove that a graph in which the degree of each vertex is at least two contains a cycle.
4. How many more edges are there in the complete graph K7 than in the complete graph K5 ?

5. Draw a picture of each of the following graphs and state whether it is directed or undirected and
whether it is simple. Also determine the degree of every vertex of the graph.
(a) G1 = (V1 , E1 ), where V1 = {a, b, c, d, e} and E1 = {{a, b}, {b, c}, {a, c}{a, d}, {a, e}}
(b) G2 = (V2 , E2 ), where V2 = {a, b, c, d, e} and E2 = {(a, b), (a, c), (a, d), (a, e), (e, c), (c, a)}.
6. Check whether the following sequences are graphic or not.

(a) {2, 3, 3, 4, 4, 5}
(b) {1, 3, 3, 4, 5, 6, 6}
(c) {1, 1, 3, 3, 3, 3, 4, 5, 8, 9}
(d) Any sequence {d1 , d2 , . . . , dn }, where all di ’s are distinct and n > 1.
(e) {4, 4, 1, 1, 1, 1, 1, 1}
(f) {1, 3, 3, 4, 5, 5, 5, 5, 5}
(g) {1, 1, 1, 2, 2, 2, 3, 3, 4, 7}
7. Suppose that G is an undirected graph with 12 edges. Suppose that G has 6 vertices of degree 3 and
the rest have degrees less than 3. Determine the minimum number of vertices G can have.
8. Give a simplest possible example of a nonnull/ nonempty undirected graph:
(a) having no vertices of odd degree;
(b) having no vertices of event degree;
(c) having exactly one vertex of odd degree;
(d) having exactly one vertex of even degree;
(e) having exactly two vertices of odd degree;
(f) having exactly two vertices of even degree.
9. How many vertices will the following graphs have if they contain:

(a) 16 edges and all vertices of degree 2;


(b) 21 edges, 3 vertices of degree 4, and the other vertices of degree 3;
(c) 24 edges and all vertices of the same degree.
10. What is the largest possible number of vertices in a graph with 35 edges and all vertices of degree at
least 3?
1
11. Suppose that in a group of 5 people: A, B, C, D, and E, the following pairs of people are acquainted
with each other. (i) A and C (ii) A and D (iii) B and C (iv) C and D (v) C and E.
(a) Draw a graph G to represent this situation.
(b) List the vertex set, and the edge set, using set notation. In other words, show sets V and E for
the vertices and edges, respectively, in G = (V, E).
(c) Write an adjacency and incidence matrix for G.
(d) Find the number of walks of length 2 and 3 between B and D. (Using adjacency matrix and
without using adjacency matrix, exhausting all the possibilities)
12. Draw the graphs represented by the following adjacency matrices in Fig 1.

Figure 1:

13. Draw the graphs represented by the following incidence matrices in Fig 2.

Figure 2:

14. . Let A be the adjacency matrix of a bipartite graph. Prove that the diagonal entries of A2n+1 are all
equal to 0, for any natural number n.
15. What is meant by the length of a walk of a graph?
16. If the degree of each vertex in a graph is at least 2, show that the graph has a cycle.
17. Is it possible to draw a sketch of K5 without lifting your pen from the paper, and without retracing
any edges?
18. Write a condition on a connected graph such that it is Euler.
2
19. Write a sufficient condition on a connected graph such that it is not Euler but it has an Euler path.
20. Show that the Konigsberg bridge problem graph does not have an Euler cycle.
21. Find all positive integers n such that Kn is (a) Euler (b) semi-Euler (a graph having an Eulerian path).
22. (a) Is there an Eulerian graph of even order and odd size (number of edges present in a graph)? (b) Is
there an Eulerian graph of odd order and even size?
23. Find an Euler tour(circuit), Euler path for each of the following graph in Fig 3 if exists.

Figure 3:

24. Write two sufficient conditions on a connected graph such that it is Hamiltonian.
25. At least how many edges must be there in a Hamiltonian graph of order 12.
26. Show that any k-regular simple graph with (2k - 1) vertices is Hamiltonian.
27. Give an example of a graph which contains

(a) an Eulerian circuit that is also a Hamiltonian cycle


(b) an Eulerian circuit, but not a Hamiltonian cycle
(c) a Hamiltonian cycle, but not an Eulerian circuit
(d) neither an Eulerian circuit nor a Hamiltonian cycle.

3
28. Prove that there is no Hamiltonian cycle in each of the following graphs in Fig 4:

Figure 4:

29. A graph is given in Fig 5.


(a) Check whether the graph is regular.
(b) What is the order of G − h and G − bh?
(c) Check whether dacbeb is a walk, trail, path, tour, cycle?
(d) Is ef a cut edge/bridge?
(e) Check whether G is Euler or Hamiltonian.
(f) List all the cut vertices of G.
(g) Draw the complement graph G of G and show that G + G is a complete graph K7 .
(h) How many components are there in G.
30. Let G be a simple graph of order 8 and 3 components. Find the maximum size (number of edges
present in a graph) of G.
31. List all non-identical simple labelled graphs with 4 vertices and 3 edges. How many of these are not
isomorphic as unlabelled graphs?

4
Figure 5:

Figure 6:

32. Use Dijkstra’s algorithm to find the shortest path and its distance between the vertices A and all other
vertices of the following two weighted graphs in Fig 6.

33. Which of the following pairs of nondirected graphs in Figure 7 are isomorphic? Justify your answer
carefully.

5
Figure 7:

You might also like