Scribd
Upload
29 views12 pages

Advance Discrete Algebra Part-2

Uploaded by

rajsonukumar90276
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
29 views12 pages

Advance Discrete Algebra Part-2

Uploaded by

rajsonukumar90276
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 12
26 | M.Sc. Vigvan Bodh Success Book Q. 28. A tree T with n vertices has 1 — 1 edges. Solution. ‘We shall prove the theorem by induction on the number of vertices, Ifn = 1, then T has no edge. Number of edges in T=O0=1-1=n-11 [n=] If n = 2, then T has only one edge. Number of edges in T=1=2-1=n-1 [n=2] Thus the theorem is true when n = 1, 2. A | Now suppose that be theorem is true for all trees having less then n | vertices. | Fig. 8 Let 7 be n tree with n vertices. Since there is one and only one path vetween every part of vertices in a tree, therefore, if we delete one edge ¢,= (71, n,), Say, from 7, then the graph will be disconnected. Also T~ e, will have exactly two components 7, and T, say. Since there are no circuits in T, therefore, components 7, and 7 both are tree, and have less than » vertices. Let n, and ny (ny FQ, y,2z)-z. @+y). Advanced Discrete Mathematics | 43 i js as ft iS: ‘The equivalent diagram 15.48 follow’ — 2 sy x Fig. 15 Q. 53. Preve that every finite semigroup has an idempotent clement. Solution. Let S be a fiite semigroup powers of x, andx € S, consider positive integral “ue, All these powers of x cannot be distinct => 3 positive integers r and 5, 7 > Sstxax. pad )) Let k= r—s. Then from (1), we have oth = xs, w(2), Again adsth = ysteth = x28 [using (2)] Proceeding in the same manner, we have x +k xs xmstk =", m EN. (3), Further tk = yk yk = ymstk [using (3)] nxn, {using (3)] Hence in general, we have westsk = x5, x € N, wa) Taking m = k and n = s, equation (4) reduce to arth = ks or ve oh, wn(5) Now, let xks = ‘ : oat (5), we get a, then a ¢ S since ks is positive integer, substituting 1" @ =a,

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy