Professional Documents
Culture Documents
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 (a 1 ) [ f (a)]1
and f(e) is an identity of G’,when e is an identity of G
41. Show that every cyclic group is abelian group
42. Prove that intersection of two subgroups of a group (G,*) is a subgroup of a group (G,*).
43. Prove that every subgroup of a cyclic group is cyclic.
44. Show that the direct product of any two distributive lattices is a distributive lattice
45. Prove that Demorgan’s laws hold good for a complemented distributive lattice 〈𝐿, ∧, ∨〉, viz (a∨ 𝑏) = 𝑎′ ∧ 𝑏′
and (a∧ 𝑏)′ = 𝑎′ ∨ 𝑏′
46. Show that every chain is a lattice
47. Draw the Hasse diagram representing the partial ordering {(A,B) : A ⊆ B} on the power set P(S) where S={a, b,
c}.Find the maximal, minimal, greatest and least elements of the poset
48. Show that every non-empty subset of a lattice has a least upper bound and a greatest lower bound
49. Show that the De Morgan’s laws are valid in a Boolean Algebra.
50. If P( S ) is power set of a non—empty S, prove that {P(S ), , ,\, , S} is a Boolean algebra
51. In a distributive complemented lattice. Show that the following are equivalent:
1) a b
2) a b 0
3) a b 1
4) b a .
52. Show that every chain is a distributive lattice
Questions Are Expected for University Exams This May or may Not Be Asked for Exams
Please do not Copy (or) Republish This Questions, Students if You Find the Same Questions in Other Sources, Kindly
report us to rejinpaulteam@gmail.com