Dominating Sets and Domination Polynomials of Square Of Cycles
|
|
- Rudolph Dalton
- 5 years ago
- Views:
Transcription
1 IOSR Joural of Mathematics IOSR-JM) ISSN: Volume 3, Issue 4 Sep-Oct. 01), PP Domiatig Sets ad Domiatio Polyomials of Square Of Cycles A. Vijaya 1, K. Lal Gipso 1 Assistat Professor, Departmet of Mathematics, Nesamoy Memorial Christia College, Marthadam, Kaayakumari District, Tamil Nadu, South Idia. Assistat Professor, Departmet of Mathematics, Mar Ephraem College of Egieerig ad Techology, Mathadam, Kaayakumari District, Tamil Nadu, South Idia. Abstract: Let G = V, E) be a simple graph. A set S V is a domiatig set of G, if every vertex i V-S is adjacet to atleast oe vertex i S. Let C be the square of the Cycle C ad let D C, i ) deote the family of all domiatig sets of C with cardiality i. Let d C, i ) = D C, i ). I this paper, we obtai a recursive formula for d C, i ). Usig this recursive formula, we costruct the polyomial, D C x =, ) i d C, ) i x i, which we call domiatio polyomial of this polyomial. Keywords: domiatio set, domiatio umber, domiatio polyomials. C ad obtai some properties of I. Itroductio Let G = V,E) be a simple graph of order V =. For ay vertex vv, the ope eighbourhood of is the set N v) = {uv/uve} ad the closed eighbourhood of is the set N[v] = N v) {v}. For a set S V, the ope eighbourhood of S is NS) = U S N v) ad the closed eighbourhood of S is N[S] = NS) S. A set S V is a domiatig set of G, if N[S] = V, or equivaletly, every vertex i V-S is adjacet to atleast oe vertex i S. The domiatio umber of a graph G is defied as the miimum size of a domiatig set of vertices i G ad it is deoted as G.A cycle ca be defied as a closed path, ad is deoted byc Defiitio The square of a graph: The d power of a graph with the same set of vertices as G ad a edge betwee two vertices if ad oly if there is a path of legth atmost betwee them. Let C be the square of the cycle C d power) with vertices. Let D C, i ) be the family of domiatig sets of the graph C with cardiality i ad let d C, i ) = D C, i ). We call the polyomial i D C, x ) = d C, i) x the domiatio polyomial of the graph C. i I the ext sectio, we costruct the families of the domiatig sets of the square of cycles by recursive method. As usual we use x for the largest iteger less tha or equal to x ad x for the smallest iteger greater tha or equal to x. Also, we deote the set {1, } by [], throughout this paper. II. Domiatig Sets Of Square Of Cycles Let D C, i ) be the family of domiatig sets of C with cardiality i. We ivestigate the domiatig sets of C. We eed the followig lemma to prove our mai results i this sectio. Lemma..1 C ) = By Lemma.1 ad the defiitio of domiatio umber, oe has the followig lemma: 4 Page
2 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles Lemma.. D C, i ) = if ad oly if i or i A simple path is a path i which all its iteral vertices have degree two, ad the ed vertices have degree oe. The followig lemma follows from observatio. Lemma.3 [] If a graph G cotais a simple path of legth k -1, the every domiatig set of G must cotai at least k vertices of the path. I order to fid a domiatig set of C, with cardiality i, we oly eed to cosider D C, i 1), D C, i 1), D C, i 1), D C, i 1) ad D C, i 1).The families of these domiatig sets ca be empty or otherwise. Thus, we have eight combiatios, whether these five families are empty or ot. Two of these combiatios are ot possible Lemma. i), & ii)). Also, the combiatio that D C, i 1) D C, i 1) D C, i 1) D C, i 1) D C, i 1) 1 3 4, ) does ot eed to be cosidered because it implies that to cosider five combiatios or cases. We cosider those cases i theorem.7). D P i = See lemma. iii)). Thus we oly eed Lemma.4 If Y D C6, i 1), ad there exists x [] such that Y {x} D C, i ), the Y D C, i 1). : Suppose that Y D C, i 1). Sice Y D C6, i 1), Y cotais at least oe vertex labeled 6, 7 or 8. If 6 Y, the Y D C, i 1), a cotradictio. Hece 7 or 8 Y, but the i this case, Y {x} D C, i ), for ay x [], also a cotradictio. Lemma. i) If D C 1, i 1) = D C3, i 1) = the D C, i 1) = ii) If D C 1, i 1), D C3, i 1) the D C, i 1), iii) If D C 1, i 1) =, D C, i 1) =, D C3, i 1) =, D C4, i 1) =, D C, i 1) =, the D C, i ) = 3 i) Sice D C 1, i 1) = D C3, i 1) =, by lemma., i -1-1 or) i -1. ii) I either case, we have D C, i 1) =. iii) Suppose that D C, i 1) =, so by Lemma., we have i 1 or i 1. If i -1, the i 1 3. Therefore D C3, i 1) =, a cotradictio. iv) Suppose that D C, i ), Let Y D C, i ) ). Thus, atleast oe vertex labeled or 1 or is i Y. If Y, the by Lemma.3, at least oe vertex labeled 1,, 3, 4 or is i Y. If 1 Y or Y, the Y {} D C 1, i 1), a cotradictio. If 3 Y, Page
3 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles the Y {} D C, i 1), a cotradictio. Now, suppose that 1 Y. The, by Lemma.3, at least oe vertex labeled, 3, 4, or 6 is i Y. If Y or 3 Y, the Y { 1} D C, i 1) a cotradictio. If 4 Y, the Y { 1} D C3, i 1), a cotradictio. If Y, the Y { 1} D C4, i 1), a cotradictio. If 6 Y, the Y { 1} D C, i 1), a cotradictio. Therefore, D C, i ) =. Lemma. 6 If D C, i ),the i) D C 1, i 1) = D C, i 1) = D C3, i 1) = D C4, i 1) = ad D C, i 1) if ad oly if =k ad i=k for some k N; ii) D C, i 1) = D C3, i 1) = D C4, i 1) = D C, i 1) = the D C 1, i 1) if ad oly if i = ; iii) D C 1, i 1) =, D C, i 1), D C3, i 1), D C4, i 1), k D C, i 1), if ad oly if = k+ ad i = for some kn; iv) D C 1, i 1), D C, i 1), D C3, i 1), D C4, i 1), ad D C, i 1) = if ad oly if i = 3. v) D C 1, i 1), D C, i 1), D C3, i 1), D C4, i 1), ad 1 D C, i 1) if ad oly if +1 i 4. i) ) Sice D C 1, i 1) ) = D C, i 1) = D C3, i 1) = D C4, i 1) =, by lemma., i 1 1 or i 1 If i 1 1, the i ad by lemma., D C, i ) =, a cotradictio. So i + 1, ad sice D C, i ), we have i + 1, which implies that = k ad i = k for some kn. ) If = k ad i = k for some kn, the by lemma., D C 1, i 1) = D C, i 1) = D C3, i 1) = D C4, i 1) =, ad D C, i 1). ii) ) Sice D C, i 1) = D C3, i 1) = D C4, i 1) = D C, i 1) =, by lemma., 3 i 1 or i 1 <. If i 1 3, the i 1 1 ad hece D C, i 1) =, a cotradictio. So i -1. Also, D C 1, i 1). Therefore i -1.Therefore i.but i. Hece i =. 1 iii) ) Sice D C 1, i 1) =, by lemma., i 1 1 or i 1 If i 1 1, the i 1,by Lemma., D C, i 1) = D C3, i 1) = D C4, i 1) = D C, i 1) =, a cotradictio. 6 Page
4 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles 1 Therefore i +1. But i 1,because D C, i 1). Therefore i +1. Hece, +1 i k This holds oly if = k + ad i = k+1 =,for some kn. k ) If = k+ ad i = for some kn, the by lemma., D C 1, i 1) =, D C, i 1), D C3, i 1), D C4, i 1) ad D C, i 1). iv) ) Sice D C, i 1) =,by lemma., i 1 or i 1. Sice D C, i 1), by lemma., + 1 i 1. Therefore i 1 possible. Therefore i 1. Therefore i -4.Therefore i -3. Sice D C3, i 1) =, i-1-4. Therefore i -3. Hece i = 3. ) if i = 3 the by lemma., D C 1, i 1), D C, i 1), D C3, i 1) =, D C4, i 1) ad D C, i 1) =. v) ) Sice D C 1, i 1), D C, i 1), D C3, i 1), D C4, i 1) 1 ad D C, i 1), the by applyig lemma., i 1 1, i 1, 3 i 1 3), 3 i 1 4) ad 3 i 1. So 1 i 1 ) ad hece i 4. 1 ) If + 1 i 4, the the result follows from lemma.. is ot Theorem.7 For every 6 ad i, i) If D C 1, i 1) = D C, i 1) = D C3, i 1) = D C4, i 1) = ad D C, i 1) the D C, i ) = {1, 6,.. 4 },{, 7,.. 3 }, {3, 8,.. },{4, 9,.. 1 },{, 10,.. }, ii) If D C, i 1) = D C3, i 1) = D C4, i 1) = D C, i 1) = ad D C 1, i 1) the D C, i ) = [], 7 Page
5 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles iii) If D C 1, i 1) =, D C, i 1), D C3, i 1), D C4, i 1) ad D C, i 1) the D C, i ) = {1, 6,.. 4 },{, 7,.. 3 },{3, 8, }, {4, 9 1 },{, 10,.. }, X 3.X 4 1 if X X, X 3 D C3, i 1), X 4 D C 4, i 3 if X 1) iv) If D C3, i 1) =, D C, i 1), D C, i ) = [] - {x}/x[].,, X D C, i 1) }.1) D C 1, i 1), the v) If D C 1, i 1), D C, i 1), D C3, i 1), D C4, i 1), D C, i 1) the D C, i ) = X 1 {}, X { - 1}, X 3 {-}, X 4 { - 3}, X {-4}/ X 1 D C 1, i 1), X D C, i 1), X 3 D C3, i 1), X 4 D C4, i 1), X D C, i 1).....) i) Sice, D C 1, i 1) = D C, i 1) = D C3, i 1) = D C4, i 1) = ad D C, i 1) by lemma.6) i) = k, ad i=k for some kn. The set {1, 6,.. 4 },{, 7,.. 3 },{3, 8,.. }, {4, 9,.. 1 },{, 10,.. }, has elemets ad it covers all vertices. The other sets with cardiality {1, 6,.. },{, 7,.. },{3, 8,.. }, {4, 9,.. },{, 10,.. }, Clearly, all these are ot domiatig sets. Therefore {1, 6,.. 4 }, {, 7,.. 3 },{3, 8,.. }, {4, 9,.. 1 },{, 10,.. }, is the oly domiatig set of cardiality = k = i. ii) We have D C, i 1) =, D C3, i 1) = D C4, i 1) = ad D C 1, i 1). By lemma.6) ii). We have i =. So,, ) iii) We have D C 1, i 1) =, D C, i 1), D C, i 1). k By lemma.6). iii), = k+ ad i = = k+1 for some kn. D C i = []. D C3, i 1), D C, i 1) = D C4, i 1) ad We deote the families Y 1 = {1, 6,,k-4,k+1 },{, 7,, k-3,k+ }, {3, 8, k-,k+3},{4, 9 k-1, k+4 },{, 10, k,k+ } ad 8 Page
6 k if X Y = X 3 k.x 4 k 1, X k 1 if X X 4 D C4, i 1), X D C, i 1) We shall prove that Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles D Ck, k 1) = Y 1 Y.Sice k, X 3 D C3, i 1), D C, k ) = {1, 6,,k-4,k+1 }, {, 7,, k-3,k+ },{3, 8, k-,k+3},{4, 9 k-1, k+4 },{, 10, k,k+ },the Y D C, k 1).Also it is obvious that Y D C, k 1). 1 k k Therefore Y Y D C, k 1)..3) 1 k ) Now let Y D Ck, k 1). The k +, k+1 or k is i Y. If k+ Y, the by lemma 3), atleast oe vertex labeled 1, or 3 ad k+1, k or k-1 is i Y. If k+1 or k is i Y, the Y {k+} D Ck 1, k), a cotradictio; because D Ck 1, k) =. Hece k 1 Y, k Y ad k + 1 Y. Therefore, Y = X {k+} for some X D Ck, k ).Hece Y Y1. Now suppose that k + 1 Y ad k+ Y. BY lemma.3) at least oe vertex labeled k, k 1or k is i Y. If ky the Y {k+1} D Ck, k ) = {1, 6,,k-4,k+1 },{, 7,, k-3,k+ },{3, 8, k-,k+3},{4, 9 k-1, k+4 },{, 10, k,k+ } a cotradictio because k X for all X D C, k ). k Therefore k 1, or k is i Y, but ky. Thus Y= X {k+1} for some of X D Ck 1, k). So D Ck, k 1) Y 1 Y....4) From.3) ad.4), D C, i ) = {1, 6,.. 4 },{, 7,.. 3 },{3, 8, }, {4, 9 1 },{, 10,.. }, X 3.X 4 1 if X X, X 3 D C3, i 1), X 4 D C 4, i 3 if X 1),, X D C, i 1) } iv) If D C3, i 1) =, D C, i 1), D C 1, i 1), by lemma.6) iv) i = 3. Therefore D P, i ) = {[] - {x} / x[]}. For example DP,) = {[6] - {x} / x[6]}. 6 {1,,3,4,,6}-{1,,3,4,,6} /6[6]}. = {1,,3,4, }-{{1,,3,4,6}-{{1,,4,,6}-{{1, 3,4,,6}-{{,3,4,,6} v) D C 1, i 1), D C, i 1), D C3, i 1), D C4, i 1), D C, i 1). Let X 1 D C 1, i 1),so atleast oe vertex labeled -1, or 3 is i X 1. If -1, - or -3 X 1, the X 1 {} D C, i ). Let X D C, i 1), the or 3 or 4 is i X. If -, -3 or -4 X, the X { 1} = D C, i ). Now let X 3 D C3, i 1) the 3, 4 or is i X 3. If 3 or 4 or X 3,the X 3 { } = D C, i ). Now let X 4 D C4, i 1), the 4, or or 6 is i X 4. If -4 X 4,the X 4 {-3} D C, i ), for X {, -1}. If - X,the X {-4} D C, i ). 9 Page
7 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles Thus we have X 1 {}, X { - 1}, X 3 {-}, X 4 { - 3}, X {-4}/ X 1 D C 1, i 1), X D C, i 1), X 3 D C3, i 1), X 4 D C4, i 1), X D C, i 1) D C, i )...) Now suppose that -1 Y, Y the by lemma 3), atleast oe vertex labeled -, -3 or i Y. If - Y the Y=X 3 ) {-} for some, X 3 D C3, i 1). Now suppose the, - Y & -4 Y, the by lemma 3) oe vertex labeled -6, -7, i Y. If -4Y, the Y = X ) {-1} for X, D C, i 1), So D C, i ) X 1 {}, X { - 1}, X 3 {-}, X 4 { - 3}, X {-4}/ X 1 D C 1, i 1), X D C, i 1), X 3 D C3, i 1), X 4 D C4, i 1), X D C, i 1)....6) From.) &.6) D C, i ) = X 1 {}, X { - 1}, X 3 {-}, X 4 { - 3}, X {-4}/ X 1 D C 1, i 1), X D C, i 1), X 3 D C3, i 1), X 4 D C4, i 1), X D C, i 1). III. Domiatio Polyomial Of A Square Cycle C ) i Let D C, x ) = d C, i) x be the domiatio polyomial of a cycle C. I this sectio, we study this polyomial. i Theorem 3.1 i) If D C, i ) is the family of domiatig sets with cardiality i of C, the d C, i) d C, i 1) d C, i 1) d C, i 1) d C, i 1) d C, i 1) ii) For every 6, D C, x ) = x D C 1, x) D C, x) D C3, x) D C4, x) D C, x) 3 D C, x) x, D C, x) x x, D C, x) x 3x 3 x, 1 3 D C, x) x 4x 6x 4 x, D C, x) x x 10x 10x x with the iitial values i) It follows from theorem.7 ii) It follows from part i) ad the defiitio of the domiatio polyomial. Usig Theorem 3.1, we obtai d C, i ) for 1 1 as show i table 1. Table 1: d C, i ), the umber of domiatig set of C with cardiality i. i Page
8 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles I the followig Theorem, we obtai some properties of d C, i ). Theorem 3. The followig properties hold for the coefficiets of D C, x ) ; i) ii) iii) iv) v) vi) vii) i) d C, ) for every N., ) 1, 1), ), 3), 4) d C for every N d C for every d C C for every 3 3 d C C for every 4 d C C for every 4 d P i, ) for i = 1,.., = 1,. D C, ) = {1, 6,.. 4 },{, 7,.. 3 },{3, 8,.. }, {4, 9 1}, {, 10 }, we have d C, ). ii) Sice D C, ) i = [],we have the result. iii) Sice D P, i ) = {[] - {x} /x[]}, we have d C, 1). iv) By iductio o The result is true for = 3 L.H.S. = dc,1) = 3 from table) 3 3. R.H.S = = 3 Therefore, the result is time for = 3 Now suppose that the result is true for all umbers less tha ad we prove it for. By theorem 3.1), d C, ) d C, 3) d C, 3) d C, 3) d C, 3) d C, 3) ) ) = ) = = 1) =. v) By iductio o The result is true for = 4 L.H.S = dc,1) = 4 from table) 4 R.H.S = dc 4,1) = Page
9 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles Therefore the result is true for = 1 Now suppose the result is for all atural umbers less tha. By theorem 3.1, d C, 3) d C, 4) d C, 4) d C, 4) d C, 4) d C, 4) = 1) ) 3) ) 3) 3) 1 6 = 1 1) ) 3) 3 ) 3) 6 3) 6 6 = 1 1) ) 3) 3 ) 3) 6 3 1) 6 = 1 1) ) 3) 3 ) 3) 6 ) 6 = 1 1) ) 3) 3 ) 3 ) 6. = 1 1) ) 3) 3 ) 1) 6 = 1 1) ) 3 3) 6 1 = 1) ) 6 vi) By iductio o Let = L.H.S = dc,1) = from table) R.H.S = 1) ) 3) = = Therefore the result is true for =1 Now suppose that the result is true for all atural umbers less tha or equal to. d C, 4) d C, ) d C, ) d C, ) d C, ) d C, ) ) ) 3) 4) ) 3) 4) 3) 4) = 4) = 1 1) ) 3) 4) 4 ) 3) 4) 1 3) 4) 4 4) 4 4 = 1 1) ) 3) 4) 4 ) 3) 4) 1 3) 4) 4 4 1) 4 = 1 1) ) 3) 4) 4 ) 3) 4) 1 3) 4) 4 3) 4 = 1 1) ) 3) 4) 4 ) 3) 4) 1 3) 4 ) 4 = 1 1) ) 3) 4) 4 ) 3) 4) 1 3) ) 4 = 1 1) ) 3) 4) 4 ) 3) 4 3) Page
10 Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles = 1 1) ) 3) 4) 4 ) 3) 1) 4 = 1 1) ) 3) 4 4) 4 1 = 1) ) 3) 4 Theorem 3.3 i) i, =, 1 i d C i i ii) For every j d C 1, j 1 d C, j1 d C, j d C, j iii) If S d C, j, the for every 6, S = S -1 + S - + S -3 + S -4 + S - with iitial values i S 1 =1, S =3, S 3 =7,S 4 =1 ad S = 31 i) by iductio o First suppose that = the, 10 d C i i d C i i,) 7,1 k d C, k ) k 1, 1 k, 1 k 3, 1 k i d C k d C k d C k d i i i C i 4, k 1 ik ik ik ik ik k d C ik i, k 1 k 1) k 1) 1) 1) 1 k 3 k d Ci k d Ci k d Ci k d Ci4 k,,,, ik1 ik1 ik1 ik1 k1) d C i k 1 i k = k d C i, k 1, ik1 We have the result. ii) By Theorem 3.1, We have d C 1, j 1) d C, j 1) = d C, j) d C, j) d C, j) d C, j) d C, j) d C, j) d C, j) d C 1, j) d C, j) d C3, j) d C4, j) d C 1, j) d C, j) d C, j) d C, j) d C, j) d C, j) d C, j 1) d C, j 1) d C, j) d C, j) 1 Therefore we have the result iii) By theorem 3.1, we have 13 Page
11 i S d C, j Domiatig Sets Ad Domiatio Polyomials Of Square Of Cycles, 1, 1), 1), 1), 1) i S d C j d C j d C j d C j d C j 1, , 1 d C, 1 j d C j d C3 j i 1 i 1 i 1 1 +, 1 1 d C, 1 4 j d C j i 1 i 1 S = S -1 + S - + S -3 + S -4 + S - Refereces [1]. S.Alikhai ad Y.H.Peg, Itroductio to domiatio polyomial of a graph. arxiv:090.1v1[math.co] 14 May 009. []. S.Alikhai ad Y.H.Peg, 009, Domiatio sets ad Domiatio Polyomials of paths, Iteratioal joural of Mathematics ad Mathematical Scieces. Article ID [3]. G.Chartad ad P.Zhag, Itroductio to Graph Theory, McGraw-Hill, Bosto, Mass, USA, 00. [4]. T.W.Hayes,S.T.hedetiemi,ad P.J.Slater, Fudametal of Domiatio i graphs,vol.08 of Moographs ad Textbooks i Pure ad Applied Mathematics, Marcel Dekker, New York,NY,USA,1998. []. S.Alikhai ad Y.H.Peg, Domiatio sets ad Domiatio Polyomials of cycles, arxiv: v [math.co] 0 May 009. [6]. A.Vijaya ad K.Lal Gipso, Domiatio sets ad Domiatio Polyomials of Square paths, accepted i Ope Access joural of Discrete Mathematics. USA Page
CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS
22 CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS 2.1 INTRODUCTION Various types of domiatio have bee studied by several authors ad more tha 75 models of domiatio are listed i the appedix
More informationPAijpam.eu IRREGULAR SET COLORINGS OF GRAPHS
Iteratioal Joural of Pure ad Applied Mathematics Volume 109 No. 7 016, 143-150 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: 10.173/ijpam.v109i7.18 PAijpam.eu
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationEQUITABLE DOMINATING CHROMATIC SETS IN GRAPHS. Sethu Institute of Technology Kariapatti, Tamilnadu, INDIA 2 Department of Mathematics
Iteratioal Joural of Pure ad Applied Mathematics Volume 104 No. 2 2015, 193-202 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v104i2.4
More informationWeakly Connected Closed Geodetic Numbers of Graphs
Iteratioal Joural of Mathematical Aalysis Vol 10, 016, o 6, 57-70 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ijma01651193 Weakly Coected Closed Geodetic Numbers of Graphs Rachel M Pataga 1, Imelda
More informationA Study on Total Rebellion Number in Graphs
Joural of Iformatics ad Mathematical Scieces Vol. 9, No. 3, pp. 765 773, 017 ISSN 0975-5748 (olie); 0974-875X (prit) Published by GN Publicatios http://www.rgpublicatios.com Proceedigs of the Coferece
More informationOn Edge Regular Fuzzy Line Graphs
Iteratioal Joural of Computatioal ad Applied Mathematics ISSN 1819-4966 Volume 11, Number 2 (2016), pp 105-118 Research Idia Publicatios http://wwwripublicatiocom O Edge Regular Fuzz Lie Graphs K Radha
More informationγ-max Labelings of Graphs
γ-max Labeligs of Graphs Supapor Saduakdee 1 & Varaoot Khemmai 1 Departmet of Mathematics, Sriakhariwirot Uiversity, Bagkok, Thailad Joural of Mathematics Research; Vol. 9, No. 1; February 017 ISSN 1916-9795
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationTRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction
Math Appl 6 2017, 143 150 DOI: 1013164/ma201709 TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES PANKAJ KUMAR DAS ad LALIT K VASHISHT Abstract We preset some iequality/equality for traces of Hadamard
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationReciprocal Series of K Fibonacci Numbers with Subscripts in Linear Form
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578 p-issn: 39-765X Volume Issue 6 Ver IV (Nov - Dec06) PP 39-43 wwwiosrjouralsorg Reciprocal Series of K iboacci Numbers with Subscripts i iear orm Sergio
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationBertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.
Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,
More informationTechnische Universität Ilmenau Institut für Mathematik
Techische Uiversität Ilmeau Istitut für Mathematik Preprit No. M 07/09 Domiatio i graphs of miimum degree at least two ad large girth Löwestei, Christia; Rautebach, Dieter 2007 Impressum: Hrsg.: Leiter
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationA Further Refinement of Van Der Corput s Inequality
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn:9-75x Volume 0, Issue Ver V (Mar-Apr 04), PP 7- wwwiosrjouralsorg A Further Refiemet of Va Der Corput s Iequality Amusa I S Mogbademu A A Baiyeri
More informationDecoupling Zeros of Positive Discrete-Time Linear Systems*
Circuits ad Systems,,, 4-48 doi:.436/cs..7 Published Olie October (http://www.scirp.org/oural/cs) Decouplig Zeros of Positive Discrete-Time Liear Systems* bstract Tadeusz Kaczorek Faculty of Electrical
More informationSeed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-75X. Volume 1, Issue 5 Ver. VIII (Sep. - Oct.01), PP 01-07 www.iosrjourals.org Seed ad Sieve of Odd Composite Numbers with Applicatios i
More informationThe Forcing Domination Number of Hamiltonian Cubic Graphs
Iteratioal J.Math. Combi. Vol.2 2009), 53-57 The Forcig Domiatio Number of Hamiltoia Cubic Graphs H.Abdollahzadeh Ahagar Departmet of Mathematics, Uiversity of Mysore, Maasagagotri, Mysore- 570006 Pushpalatha
More informationAdjacent vertex distinguishing total coloring of tensor product of graphs
America Iteratioal Joural of Available olie at http://wwwiasiret Research i Sciece Techology Egieerig & Mathematics ISSN Prit): 38-3491 ISSN Olie): 38-3580 ISSN CD-ROM): 38-369 AIJRSTEM is a refereed idexed
More informationArkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan
Arkasas Tech Uiversity MATH 94: Calculus II Dr Marcel B Fia 85 Power Series Let {a } =0 be a sequece of umbers The a power series about x = a is a series of the form a (x a) = a 0 + a (x a) + a (x a) +
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More informationUniversity of Twente The Netherlands
Faculty of Mathematical Scieces t Uiversity of Twete The Netherlads P.O. Box 7 7500 AE Eschede The Netherlads Phoe: +3-53-4893400 Fax: +3-53-48934 Email: memo@math.utwete.l www.math.utwete.l/publicatios
More informationLinear chord diagrams with long chords
Liear chord diagrams with log chords Everett Sulliva Departmet of Mathematics Dartmouth College Haover New Hampshire, U.S.A. everett..sulliva@dartmouth.edu Submitted: Feb 7, 2017; Accepted: Oct 7, 2017;
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationFermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.
Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times
More informationAlliance Partition Number in Graphs
Alliace Partitio Number i Graphs Lida Eroh Departmet of Mathematics Uiversity of Wiscosi Oshkosh, Oshkosh, WI email: eroh@uwoshedu, phoe: (90)44-7343 ad Ralucca Gera Departmet of Applied Mathematics Naval
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationOn size multipartite Ramsey numbers for stars versus paths and cycles
Electroic Joural of Graph Theory ad Applicatios 5 (1) (2017), 4 50 O size multipartite Ramsey umbers for stars versus paths ad cycles Aie Lusiai 1, Edy Tri Baskoro, Suhadi Wido Saputro Combiatorial Mathematics
More informationBest Optimal Stable Matching
Applied Mathematical Scieces, Vol., 0, o. 7, 7-7 Best Optimal Stable Matchig T. Ramachadra Departmet of Mathematics Govermet Arts College(Autoomous) Karur-6900, Tamiladu, Idia yasrams@gmail.com K. Velusamy
More informationOn matchings in hypergraphs
O matchigs i hypergraphs Peter Frakl Tokyo, Japa peter.frakl@gmail.com Tomasz Luczak Adam Mickiewicz Uiversity Faculty of Mathematics ad CS Pozań, Polad ad Emory Uiversity Departmet of Mathematics ad CS
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationFundamental Theorem of Algebra. Yvonne Lai March 2010
Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex
More informationOn the Number of 1-factors of Bipartite Graphs
Math Sci Lett 2 No 3 181-187 (2013) 181 Mathematical Scieces Letters A Iteratioal Joural http://dxdoiorg/1012785/msl/020306 O the Number of 1-factors of Bipartite Graphs Mehmet Akbulak 1 ad Ahmet Öteleş
More informationJournal of Ramanujan Mathematical Society, Vol. 24, No. 2 (2009)
Joural of Ramaua Mathematical Society, Vol. 4, No. (009) 199-09. IWASAWA λ-invariants AND Γ-TRANSFORMS Aupam Saikia 1 ad Rupam Barma Abstract. I this paper we study a relatio betwee the λ-ivariats of a
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationYou may work in pairs or purely individually for this assignment.
CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or
More informationBi-Magic labeling of Interval valued Fuzzy Graph
Advaces i Fuzzy Mathematics. ISSN 0973-533X Volume 1, Number 3 (017), pp. 645-656 Research Idia Publicatios http://www.ripublicatio.com Bi-Magic labelig of Iterval valued Fuzzy Graph K.Ameeal Bibi 1 ad
More informationA Study on Some Integer Sequences
It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 03-09 A Study o Some Iteger Sequeces Serpil Halıcı Sakarya Uiversity, Departmet of Mathematics Esetepe Campus, Sakarya, Turkey shalici@sakarya.edu.tr Abstract.
More informationNotes on the Combinatorial Nullstellensatz
Notes o the Combiatorial Nullstellesatz Costructive ad Nocostructive Methods i Combiatorics ad TCS U. Chicago, Sprig 2018 Istructor: Adrew Drucker Scribe: Roberto Ferádez For the followig theorems ad examples
More informationA New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem
This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410
More informationSymmetric Division Deg Energy of a Graph
Turkish Joural of Aalysis ad Number Theory, 7, Vol, No 6, -9 Available olie at http://pubssciepubcom/tat//6/ Sciece ad Educatio Publishig DOI:69/tat--6- Symmetric Divisio Deg Eergy of a Graph K N Prakasha,
More informationBI-INDUCED SUBGRAPHS AND STABILITY NUMBER *
Yugoslav Joural of Operatios Research 14 (2004), Number 1, 27-32 BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * I E ZVEROVICH, O I ZVEROVICH RUTCOR Rutgers Ceter for Operatios Research, Rutgers Uiversity,
More informationSome Common Fixed Point Theorems in Cone Rectangular Metric Space under T Kannan and T Reich Contractive Conditions
ISSN(Olie): 319-8753 ISSN (Prit): 347-671 Iteratioal Joural of Iovative Research i Sciece, Egieerig ad Techology (A ISO 397: 7 Certified Orgaizatio) Some Commo Fixed Poit Theorems i Coe Rectagular Metric
More informationMath 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix
Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More informationFuzzy Shortest Path with α- Cuts
Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 58 Issue 3 Jue 2018 Fuzzy Shortest Path with α- Cuts P. Sadhya Assistat Professor, Deptt. Of Mathematics, AIMAN College of Arts ad Sciece
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationThe Multiplicative Zagreb Indices of Products of Graphs
Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 8, Number (06), pp. 6-69 Iteratioal Research Publicatio House http://www.irphouse.com The Multiplicative Zagreb Idices of Products of Graphs
More informationk-equitable mean labeling
Joural of Algorithms ad Comutatio joural homeage: htt://jac.ut.ac.ir k-euitable mea labelig P.Jeyathi 1 1 Deartmet of Mathematics, Govidammal Aditaar College for Wome, Tiruchedur- 628 215,Idia ABSTRACT
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationf(x)g(x) dx is an inner product on D.
Ark9: Exercises for MAT2400 Fourier series The exercises o this sheet cover the sectios 4.9 to 4.13. They are iteded for the groups o Thursday, April 12 ad Friday, March 30 ad April 13. NB: No group o
More informationAbsolutely Harmonious Labeling of Graphs
Iteratioal J.Math. Combi. Vol. (011), 40-51 Absolutely Harmoious Labelig of Graphs M.Seeivasa (Sri Paramakalyai College, Alwarkurichi-6741, Idia) A.Lourdusamy (St.Xavier s College (Autoomous), Palayamkottai,
More informationA proof of Catalan s Convolution formula
A proof of Catala s Covolutio formula Alo Regev Departmet of Mathematical Scieces Norther Illiois Uiveristy DeKalb, IL regev@mathiuedu arxiv:11090571v1 [mathco] 2 Sep 2011 Abstract We give a ew proof of
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationTHE TRANSFORMATION MATRIX OF CHEBYSHEV IV BERNSTEIN POLYNOMIAL BASES
Joural of Mathematical Aalysis ISSN: 17-341, URL: http://iliriascom/ma Volume 7 Issue 4(16, Pages 13-19 THE TRANSFORMATION MATRIX OF CHEBYSHEV IV BERNSTEIN POLYNOMIAL BASES ABEDALLAH RABABAH, AYMAN AL
More informationDavenport-Schinzel Sequences and their Geometric Applications
Advaced Computatioal Geometry Sprig 2004 Daveport-Schizel Sequeces ad their Geometric Applicatios Prof. Joseph Mitchell Scribe: Mohit Gupta 1 Overview I this lecture, we itroduce the cocept of Daveport-Schizel
More informationChain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1
CHAINS 1.1 Chai coditios 1. Artiia ad oetheria modules. (1.1) Defiitio. Let A be a rig ad M a A-module. The module M is oetheria if every ascedig chai!!m 1 M 2 of submodules M of M is stable, that is,
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationA GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca
Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationOn the Inverse of a Certain Matrix Involving Binomial Coefficients
It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 5-56 O the Iverse of a Certai Matrix Ivolvig Biomial Coefficiets Yoshiari Iaba Kitakuwada Seior High School Keihokushimoyuge, Ukyo-ku, Kyoto, 60-0534, Japa
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More information-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION
NEW NEWTON-TYPE METHOD WITH k -ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION R. Thukral Padé Research Cetre, 39 Deaswood Hill, Leeds West Yorkshire, LS7 JS, ENGLAND ABSTRACT The objective
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More informationApplied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients
Applied Mathematics Letters 3 (1 68 7 Cotets lists available at ScieceDirect Applied Mathematics Letters joural homepage: wwwelseviercom/locate/aml O the properties of Lucas umbers with biomial coefficiets
More informationON THE NUMBER OF LAPLACIAN EIGENVALUES OF TREES SMALLER THAN TWO. Lingling Zhou, Bo Zhou* and Zhibin Du 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol 19, No 1, pp 65-75, February 015 DOI: 1011650/tjm190154411 This paper is available olie at http://jouraltaiwamathsocorgtw ON THE NUMBER OF LAPLACIAN EIGENVALUES OF
More informationExam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.
1 (1 poits) Circle T if the correspodig statemet is True or F if it is False T F For ay positive iteger,, GCD(, 1) = 1 T F Every positive iteger is either prime or composite T F If a b mod p, the (a/p)
More informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
More informationMa/CS 6b Class 19: Extremal Graph Theory
/9/05 Ma/CS 6b Class 9: Extremal Graph Theory Paul Turá By Adam Sheffer Extremal Graph Theory The subfield of extremal graph theory deals with questios of the form: What is the maximum umber of edges that
More informationCommon Coupled Fixed Point of Mappings Satisfying Rational Inequalities in Ordered Complex Valued Generalized Metric Spaces
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn:319-765x Volume 10, Issue 3 Ver II (May-Ju 014), PP 69-77 Commo Coupled Fixed Poit of Mappigs Satisfyig Ratioal Iequalities i Ordered Complex
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationPolynomial Functions. New Section 1 Page 1. A Polynomial function of degree n is written is the form:
New Sectio 1 Page 1 A Polyomial fuctio of degree is writte is the form: 1 P x a x a x a x a x a x a 1 1 0 where is a o-egative iteger expoet ad a 0 ca oly take o values where a, a, a,..., a, a. 0 1 1.
More informationSolution of Differential Equation from the Transform Technique
Iteratioal Joural of Computatioal Sciece ad Mathematics ISSN 0974-3189 Volume 3, Number 1 (2011), pp 121-125 Iteratioal Research Publicatio House http://wwwirphousecom Solutio of Differetial Equatio from
More informationCOMMON FIXED POINT THEOREMS VIA w-distance
Bulleti of Mathematical Aalysis ad Applicatios ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 3 Issue 3, Pages 182-189 COMMON FIXED POINT THEOREMS VIA w-distance (COMMUNICATED BY DENNY H. LEUNG) SUSHANTA
More informationInternational Journal of Mathematical Archive-3(4), 2012, Page: Available online through ISSN
Iteratioal Joural of Mathematical Archive-3(4,, Page: 544-553 Available olie through www.ima.ifo ISSN 9 546 INEQUALITIES CONCERNING THE B-OPERATORS N. A. Rather, S. H. Ahager ad M. A. Shah* P. G. Departmet
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More information