MATHS ASSESSMENT 2 ANSWER KEY

PART A
1.

The graph 𝑮𝟑 contains the Eulerian circuit

𝑨 − 𝑩 − 𝑪 − 𝑫 − 𝑩 − 𝑬 − 𝑨.
But this is not a Hamiltonian circuit as the
vertex 𝑩 is repeated twice
2.
b

a
c
3. By Handshaking theorem, we have
∑𝑛𝑖=1 deg (vi )= 𝟐𝒆

𝒅𝒆𝒈 (𝒗𝟏) + 𝒅𝒆𝒈 (𝒗𝟐) + ⋯ 𝒅𝒆𝒈 (𝒗𝟏𝟎) = 𝟐𝒆

𝟓 + 𝟓 + ⋯ + 𝟓 (𝟏𝟎𝒕𝒊𝒎𝒆𝒔 )= 𝟐𝒆
⟹ 𝟐𝒆 = 𝟓𝟎
⟹ 𝒆 =𝟓𝟎/𝟐= 𝟐𝟓
Hence, number of edges is 𝟐𝟓
4.{N,+}
5.z6={[0],[1],[2],[3],[4],[5]}
H={[0],[3]}
Left cosets:
[0]xH={[0],[0]}
[1]xH={[0],[3]}=H
[2]xH={[0],[0]}
[3]xH={[0],[3]}=H
[4]xH={[0],[0]}
[5]xH={[0],[3]}=H
PART B
6a.

GRAPHS NO. OF VERTICES NO. OF EDGES DEGREE SEQUENCES

G1 4 3 1,2,2,1
G2 4 3 1,2,2,1

• Number of vertices and number of edges of both the graphs are same.

• The degree sequences of both the graphs are same.

• Hence the three invariant conditions are satisfied.

Deg(a)=1 2 deg(1)=1 2

Deg(b)=2 1,2 deg(2)=2 1,2

Deg(c)=2 2,1 deg(3)=2 2,1

Deg(d)=1 2 deg(4)=1 2

Let 𝒇 ∶ 𝑮1 → G2 such that

𝒇 (a) = 1, 𝒇 (b )= 2, 𝒇 (c )= 𝟑, 𝒇( d )= 𝟒

The adjacency matrix of the graph 𝑮1 is

0 1 0 0
1 0 1 0
AG1 =[ ]
0 1 0 1
0 0 1 0
0 1 0 0
1 0 1 0
AG2 =[ ]
0 1 0 1
0 0 1 0
The two adjacency matrices of 𝑮1 and G2 are same.

Hence, the graphs 𝑮1 and G2 are isomorphic graphs.

6 b. Let 𝑯 be a subgroup.
Then if 𝒂, 𝒃 ∈ 𝑯, 𝒃−𝟏 ∈ 𝑯
Therefore, 𝒂 ∗ 𝒃−𝟏 ∈ 𝑯 by closure property.
Hence, 𝒂, 𝒃 ∈ 𝑯 ⟹ 𝒂 ∗ 𝒃−𝟏 ∈ 𝑯.
Thus, the condition is necessary.
Let 𝒂 ∗ 𝒃−𝟏 ∈ 𝑯, where 𝒂, 𝒃 ∈ 𝑯, where 𝑯 is not empty subset of 𝑮.
If 𝒃 = 𝒂, the given condition gives
𝒂 ∗ 𝒂−𝟏 ∈ 𝑯
𝒆 ∈ 𝑯 ---------(1)
Using the given condition for the pair
𝒆, 𝒂 ∈ 𝑯, we have
𝒆 ∗ 𝒂−𝟏 ∈ 𝑯
𝒂−𝟏 ∈ 𝑯 -------(2)
Using the given condition for the pair 𝒆, 𝒃 ∈ 𝑯, we
have
𝒆 ∗ 𝒃−𝟏 ∈ 𝑯
𝒃−𝟏 ∈ 𝑯 -------(3)
Using the given condition for the pair 𝐚, 𝒃−𝟏 ∈ 𝑯,
we have
𝐚 ∗ (𝒃−𝟏)−𝟏∈ 𝑯
𝐚 ∗ 𝒃 ∈ 𝑯 -------(4)
From (1), (2), (3) and (4), it follows that 𝑯,∗ is a subgroup of 𝑮,∗ .
Thus the condition is sufficient.
7ai.
Case 1 : If 𝑮 is complete, then 𝑮 is Hamiltonian.

Case 2 : If 𝑮 is not complete. Let 𝒖𝟏, 𝒗𝟏 , 𝒖𝟐, 𝒗𝟐 , … , 𝒖𝒏, 𝒗𝒏 be non adjacent pair of vertices in 𝑮.
(Addition of these edges makes the graph 𝑮 complete).

𝒅𝒆𝒈 (𝒖𝒊) + 𝒅𝒆𝒈 (𝒗𝒊) ≥ 𝒏/ 𝟐 + 𝒏/ 𝟐 = 𝒏 by the given hypothesis.

Now take 𝑮𝟏 = 𝑮 + 𝒖𝟏𝒗𝟏, 𝑮𝟐 = 𝑮𝟏 + 𝒖𝟐𝒗𝟐, … , 𝑮𝒏 = 𝑮𝒏−𝟏 + 𝒖𝒏𝒗𝒏 where 𝑮𝒏 is complete.

Now since 𝑮𝒏 is complete and so 𝑮𝒏 is Hamiltonian.

Moreover 𝒖𝒏 and 𝒗𝒏 are non adjacent vertices in 𝑮𝒏−𝟏 such that 𝒅𝒆𝒈 𝒖𝒏 + 𝒅𝒆𝒈 𝒗𝒏 ≥ 𝒏.

By Theorem, we have Let 𝑮 be a simple undirected graph with 𝒏 vertices and let 𝒖 and 𝒗 be two
non-adjacent vertices in 𝑮 such that 𝒅𝒆𝒈 𝒖 + 𝒅𝒆𝒈 𝒗 ≥ 𝒏 in 𝑮 , then 𝑮 is Hamiltonian if and only if 𝑮
+ 𝒖𝒗 is Hamiltonian.

Hence, by the above theorem, 𝑮𝒏−𝟏 is Hamiltonian.

Proceeding with the same argument, we get 𝑮𝒏−𝟐,𝑮𝒏−𝟑, … ,𝑮 all Hamiltonian

In particular, 𝐆 is Hamiltonian
7aii.

Let the graph 𝑮 be Eulerian and so it has an Eulerian circuit 𝒗𝟏𝒆𝟏𝒗𝟐𝒆𝟐𝒗𝟑 … … … 𝒆𝒏𝒗𝟏 which
traverses through all edges of 𝑮 only once.

The internal vertex 𝒗𝒊 is incident on two edges 𝒆𝒊 and 𝒆𝒊+𝟏 both of which contribute degree 𝟐 to 𝒗𝒊
So, each time 𝒗𝒊 occurs as an internal vertex, degree 𝟐 is added to its degree.

Therefore, its total degree is even.

The terminal vertex 𝒗𝟏 is incident on two edges 𝒆𝟏 and 𝒆𝒏. So, its degree is also even.

Therefore, all the edges are present, all vertices are present in the Eulerian circuit.

Hence, degree of all vertices are of even degree

7bii. Let 𝑮 = 𝑽, 𝑬 be the undirected graph.

Let 𝑽𝟏 and 𝑽𝟐 be the sets of vertices of 𝑮 of even and odd degrees respectively.

Then by Handshaking theorem, we have

∑𝑣𝑖∈V1 deg (vi) + ∑𝑣𝑖∈V2 deg (vj) = 𝟐𝒆 ……(1)

Since each 𝒅𝒆𝒈(𝒗𝒊) is even,

∑𝑣𝑖∈V1 deg (vi) is even.

As the R.H.S of (1) is even, we have

∑𝑣𝑖∈V2 deg (vj) is even.

Since each 𝒅𝒆𝒈 (𝒗𝒋) is odd, the number of terms contained in ∑𝑣𝑖∈V2 deg (vj) or in 𝑽𝟐 is even.

Hence, the number of vertices of odd degree is even

8ai. (i) Closure :

𝑎 𝑏 𝑐 𝑑
Let [ ],[ ]∈A
−𝑏 𝑎 −𝑑 𝑐
𝑎 𝑏 𝑐 𝑑 𝑎𝑐 − 𝑏𝑑 𝑎𝑑 + 𝑏𝑐
Then [ ][ ]= [ ]∈A
−𝑏 𝑎 −𝑑 𝑐 −(𝑎𝑑 + 𝑏𝑐) 𝑎𝑐 − 𝑏𝑑

Therefore, Matrix multiplication is closed

(ii) Associative :

Matrix multiplication is associative

(iii) Identity element:

A has no identity element

A is not a group

Hence it is not an abelian group

8.b.ii

The composition table for +𝟒 and ×𝟒 are given as follows,

From the composition table, we observe the following

(i) All the entries in both the table belongs to 𝒁𝟒.

Hence 𝒁𝟒 is closed under +𝟒 and ×𝟒.

(ii) The entries in the first row are same as those of the first column.

Hence 𝒁𝟒 is commutative with respect to both +𝟒 and ×𝟒.

(iii) If 𝒂, 𝒃, 𝒄 ∈ 𝒁𝟒, it is easily verified that

𝐚 +𝟒 (𝐛 +𝟒 𝐜) = (𝒂 +𝟒 𝐛) +𝟒 𝐜

𝐚 x𝟒 (𝐛 x𝟒 𝐜) = (𝒂 x𝟒 𝐛) x𝟒 𝐜

For example, 2, 3, 1 ∈ 𝒁𝟒,

𝟐 +𝟒 (𝟑 +𝟒 𝟏) = 𝟐 +𝟒 𝟎 = 𝟐

(𝟐 +𝟒 𝟑) +𝟒 𝟏 = 𝟏 +𝟒 𝟏 = 𝟐

∴ 𝟐 +𝟒 (𝟑 +𝟒 𝟏) =( 𝟐 +𝟒 𝟑) +𝟒 𝟏

Hence, +𝟒 is Associative.

Similarly, 𝟐 x𝟒 (𝟑 x𝟒 𝟏) = 𝟐 x𝟒 𝟑 = 𝟐

(𝟐 x𝟒 𝟑) x𝟒 𝟏 = 𝟐 x𝟒 𝟏 = 𝟐

∴ 𝟐 x𝟒 (𝟑 x𝟒 𝟏) =( 𝟐 x𝟒 𝟑) x𝟒 𝟏

Hence, ×𝟒 is Associative.

(iv) If 𝒂 ∈ 𝒁𝟒,

𝟎 +𝟒 𝐚 = 𝐚 +𝟒 𝟎 = 𝐚

𝟏 ×𝟒 𝐚 = 𝐚 ×𝟒 𝟏 = 𝐚

Hence, 𝟎 & 𝟏 are the additive and multiplicative identities of 𝒁𝟒.

(v) The additive inverses of 𝟎 , 𝟏, 𝟐, 𝟑 are 𝟎, 𝟑, 𝟐, 𝟏 respectively.

(vi) If 𝒂, 𝐛 ∈ 𝒁𝟒, then it can be verified that

𝐚 +𝟒 𝐛 = 𝐛 +𝟒 𝒂

𝐚 x𝟒 𝐛 = 𝐛 x𝟒 𝒂

Let 𝟏, 𝟐∈ 𝒁𝟒
𝟏 ×𝟒 𝟐 = 2

2 ×𝟒 1 = 2

𝟏 +𝟒 𝟐 = 3

2 +𝟒 1 = 3

Hence,+𝟒 is commutative

Hence, x𝟒 is commutative

But {Z4,+4} is commutative group

But {Z4,+4} is not a commutative group since it has no inverse elements.

PART C

9. Statement :

The order of a subgroup of a finite group divides the order of the group.

Proof :

Let {𝑮,∗} be a finite group of order n.

𝐎(𝑮) = 𝒏

Let {𝑯,∗} be a subgroup of 𝑮 of order 𝒎

𝐎(𝑯)= 𝒎

To Prove: Set of all left cosets of 𝑯 form a partition for 𝑮.

Let 𝒂𝑯 and 𝒃𝑯 be two left cosets of 𝑯.

We shall prove either 𝒂𝑯 = 𝒃𝑯 Or 𝒂𝑯 ∩ 𝒃𝑯 = ∅

Suppose 𝒂𝑯 ∩ 𝒃𝑯 ≠ ∅

Then say 𝒄 ∈ 𝒂𝑯 ∩ 𝒃𝑯

⟹ 𝒄 ∈ 𝒂𝑯 and 𝒄 ∈ 𝒃𝑯

⟹ 𝒄 = 𝒂 ∗ 𝒉𝟏 where 𝒉𝟏 ∈ 𝑯, 𝒂 ∈ 𝑮

⟹ 𝒄 = 𝒂 ∗ 𝒉𝟏 where 𝒉𝟏 ∈ 𝑯, 𝒂 ∈ 𝑮 ------(I)

and 𝒄 = 𝒃 ∗ 𝒉𝟐 where 𝒉𝟐 ∈ 𝑯, 𝒃 ∈ 𝑮 -----(1)

Post multiplying (I) by 𝒉𝟏 −𝟏 , we have

𝒄 ∗ 𝒉𝟏 −𝟏 = 𝒂 ∗ 𝒉𝟏 ∗ 𝒉𝟏 −𝟏

𝒄 ∗ 𝒉𝟏 −𝟏 = 𝒂 ∗ 𝒆

𝒄 ∗ 𝒉𝟏 −𝟏 = 𝒂 -------(2)

Take an element 𝒙 from 𝒂𝑯

𝒙 ∈ 𝒂𝑯
𝒙 = 𝒂 ∗ 𝒉𝟑 where 𝒉𝟑 ∈ 𝑯

𝒙 = 𝒄 ∗ 𝒉𝟏 −𝟏 ∗ 𝒉𝟑 [By (2)]

𝒙 = 𝒃 ∗ 𝒉𝟐 ∗ 𝒉𝟏 −𝟏 ∗ 𝒉𝟑 [By (1)]

𝒙 = 𝒃 ∗ 𝒉𝟒 where 𝒉𝟒 = 𝒉𝟐 ∗ 𝒉𝟏 −𝟏 ∗ 𝒉𝟑 ∈ 𝑯

𝒙 ∈ 𝒃𝑯
Therefore, 𝒂𝑯 ⊆ 𝒃𝑯 --------(3)

Similarly, 𝒃𝑯 ⊆ 𝒂𝑯 --------(4)

From (3) and (4), we have 𝒂𝑯 = 𝒃𝑯

Moreover, 𝒂𝑯 ⊆ 𝑮

U𝒂∈𝑮 𝒂𝑯 ⊆ 𝑮 ------(5)

Since 𝒂 ∈ 𝑮, 𝒂 ∈ 𝒂𝑯

Now 𝒂 ∈ U𝒂∈𝑮 𝒂𝑯

𝑮 ⊆ 𝒂∈𝑮 𝒂𝑯 -------(6)

From (5) and (6), we have U𝒂∈𝑮 𝒂𝑯 = 𝑮

To prove : There is a one to one correspondence between any two left cosets of H in G

Define 𝒇: 𝑯 → 𝒂𝑯 by

𝒇(𝒉) = 𝒂 ∗ 𝒉 where 𝒉 ∈ 𝑯 and 𝒂 ∈ 𝑮

Let 𝒇 (𝒉𝟏) = 𝒇 (𝒉𝟐)

𝒂 ∗ 𝒉𝟏 = 𝒂 ∗ 𝒉𝟐

𝒉𝟏 = 𝒉𝟐 [By left cancellation]

Therefore, 𝒇 is one-one.

Let 𝒚 ∈ 𝒂𝑯

𝒚=𝒂∗𝒉

Take preimage 𝒙 = 𝒉 in 𝑯.

𝒇( 𝒙) = 𝒇 (𝒉)

𝒇( 𝒙) = 𝒂 ∗ 𝒉

𝒇( 𝒙) = 𝒚

Therefore, 𝒇 is onto.

Since 𝒇 is both one-one and onto, 𝑯 and 𝒂𝑯 have same number of elements.

⟹| 𝑯 |=| 𝒂𝑯| = 𝒎.

To prove:
𝑶 𝑯 |𝑶 𝑮 Assume that there are 𝒌 disjoint left cosets of 𝑯 in 𝑮.

Say, 𝒂𝟏𝑯, 𝒂𝟐𝑯, … , 𝒂𝒌𝑯 are 𝒌 distinct left cosets of 𝑯.

𝒂𝟏𝑯 ∪ 𝒂𝟐𝑯 ∪ ⋯ ∪ 𝒂𝒌𝑯 = 𝑮

|𝒂𝟏𝑯 ∪ 𝒂𝟐𝑯 ∪ ⋯ ∪ 𝒂𝒌𝑯| = |𝑮|

|𝒂𝟏𝑯| +| 𝒂𝟐𝑯| + ⋯ +| 𝒂𝒌𝑯| = 𝒏 [Since all 𝒌 left cosets are distinct]

𝒎 + 𝒎 + ⋯ + 𝒎(𝒌 𝒕𝒊𝒎𝒆𝒔) = 𝒏

𝒌𝒎 = 𝒏

⇒ 𝒌 = 𝒏| 𝒎

𝒎|𝒏

(i.e) 𝑶 𝑯 |𝑶 𝑮

Hence, the order of a subgroup of a finite group divides the order of the group