Professional Documents
Culture Documents
www.BrainKart.com
Click Here for Discrete Mathematics full study material.
25. Draw the graph with 5 vertices A, B, C, D and E such that the deg(A)= 3, B is an odd vertex, deg(c)=2
and D and E are adjacent
26. The adjacency matrices of 2 pairs of graphs are given below. Examine the isomorphism of G and H by
finding a permutation matrix
0 0 1 0 1 1
𝐴𝐺 = [0 0 1] , 𝐴𝐻 = [1 0 0]
1 1 0 1 0 0
27. Show that the complete graph with n vertices 𝑲𝒏 has a Hamiltonian circuit whenever n ≥ 3.
28. Prove that number of odd degree vertices in any graph is even
29. Prove that an undirected graph has an even number of vertices of odd degree
30. Using circuits, examine whether the following pairs of graphs𝑮𝟏, 𝑮𝟐 given below are isomorphic or not
31. Prove that the maximum the number of edges in a simple disconnected graph G with n vertices and k components is
(n k)(n k 1)
.
2
32. Prove that a connected graph G is Eulerian(Euler graph) if and only if all the vertices of G are of even degree
33. Show that if a graph with n vertices is self-complementary then 𝑛 ≡ 0 𝑜𝑟 1(𝑚𝑜𝑑 4).
34. State and prove Lagrange’s theorem
35. If (G, *) is an abelian group, show that (𝑎 ∗ 𝑏)2 =𝑎2 ∗ 𝑏2.
36. Prove that every finite group of order n is isomorphic to a permutation group of order n.
37. Prove the theorem : Let 〈 𝐺,∗〉 be a finite cyclic group generated by an element a ϵ G. If G is of order n, then
𝑎𝑛= e, so that G ={𝑎, 𝑎2, 𝑎3, … , 𝑎𝑛 = 𝑒}. Further more n is a least positive integer for which 𝑎𝑛 = 𝑒.
38. Let (𝐺,∗) and (𝐻,△) be group homomorphism. Then prove that the Kernel of g is normal subgroup of (𝐺,∗).
39. Prove that the set Z4 0,1,2,3 is a commutative ring with respect to the binary operation addition
modulo and multiplication modulo +4, ×4
40. If f : G G is a group homomorphism from {G,*} to {G, } then prove that for any a G, f (a1) [ f (a)]1
www.BrainKart.com
Click Here for Discrete Mathematics full study material.
www.BrainKart.com