Assignment 1(M1,M2,M3)
Module1
1. Define and give example for each of the following; 1) connected graph 2) Graph 3) degree
of a graph 4) complete graph 5) Bipartite graph 6) Regular graph 7) Minimally connected
graph 8) subgraph 9) walk 10) circuit 11) cycle 12) spanning tree 13) tree 14) finite graph 15)
Isolated vertex 16) pendant vertex 17) finite Graph 18) path
Applications of graph
2. Write a note on “Konigsberg bridge problem and its solution” with a diagram
3. Prove that in every graph, the number of vertices of odd degree is even
4.
5. Show that the maximum number of edges in a simple graph with n vertices
is n(n – 1)/2.
6. Distinguish between Complete graph and Complete Bipartite graph.
8. Show that a simple graph with n vertices and k components can have at most
(n − k)(n − k + 1)/2 edges.
9.
10. list and explain types of graph
11. if a connected graph is decomposed into two subgraphs g1 and g2 prove that there must
be alteast one vector common between g1 and g2
12. check for isomorphic
Module2
1. A given connected graph G is an Euler graph if and only if all vertices of G are of
even degree
2. Operations on the graph
3. Define Hamiltonian cycle. How many edge-disjoint Hamiltonian cycles exist in a
complete graph with 7 vertices? Draw the graph to show and specify the cycle.
4. Travelling salesman problem
5. Show that in a complete graph with n vertices there are (n-1)/2 edge disjoint
hamiltonian circuits if n is odd number >=3.
6. Prove that: If all the vertices in a connected graph G are of even degree, then G is
Eulerian.
7. Prove that in any digraph the sum of the in-degrees of all vertices is equal to the sum
of their out-degrees; and this sum is equal to the number of edges in the digraph.
8. Show that a connected graph G has an Eulerian trail if and only if there are exactly
two vertices of odd degree in G.
9. Types of digraph
10. Types of relations
11. Define Binary relation. Represent the relation R defined on A = {2, 3, 4, 6} by
the phrase ‘is a factor of’ in a digraph.
Module 3
1. Properties of tree
2. Define binary tree and its properties
3. Show that every connected graph contains a spanning tree.
4. Prove that in a tree with two or more vertices there are at least two pendant vertices.
5.
6. suppose that a tree has two vertices of degree 2 four vertices of degree 3 and 3
vertices of degree 4 find the number of pendant vertices in T
7. prove handshaking lemma
8.Spanning tree using prims
Assignment 2(M3,M4,M5)
2 Explain Edge connectivity and vertex connectivity with example
3 List the different properties of cut-set.
4 Define a Fundamental Circuit. If G is a graph with n vertices and q edges, then find
the number of fundamental circuits in the graph.
5 Show that for any graph G, the vertex connectivity cannot exceed the edge
connectivity and the edge connectivity cannot exceed the degree of the vertex with the.
8. Prove that a complete graph with 5 vertices is non planar.
Prove that a connected planar graph with ‘n’ number of vertices and ‘e’ number of
edges has e – n + 2 regions.
10 If � is a simple planar graph with at least three vertices, then show that (i)
��≤3��− and (ii) ��≤2�� ; if
� is triangle free.
12 PT, Kuratowski’s second graph is also nonplanar.
Kuratowski’s theorem :
, Kuratowski’s second graph is also nonplanar
13 Define Properly colored graph, chromatic number, uniquely colorable graph
Prove that every tree with two/more vertices is 2 chromatic.
Prove that an n vertex is a tree if and only if its chromatic polynomial is P n (λ) = λ(λ –1) n -
1.
19 State and Prove Five color theorem
Prove that a graph with at least one edge is 2-chromatic if and only if it has no circuits of odd
length.
