Prime labeling of generalized Petersen graph
|
|
- Nigel Cobb
- 5 years ago
- Views:
Transcription
1 Iteratioal Joural of Mathematics a Soft Computig Vol.5, No.1 (015), ISSN Prit : Prime labelig of geeralize Peterse graph ISSN Olie: U. M. Prajapati 1, S. J. Gajjar 1 Departmet of Mathematics, St. Xavier College Ahmeaba , Iia. uaya64@yahoo.com Geeral Departmet, Govermet Polytechic Himmatagar , Iia. sachi@gmail.com Abstract I the preset work we have iscusse primality of geeralize Peterse graph P (, k). We have prove that geeralize Peterse graph P (, k) is prime the must be eve a k must be o. We have also fou some classes of geeralize Peterse graph P (, k) which amits prime labelig. Keywors: Graph labelig, prime labelig, geeralize Peterse graph. AMS Subject Classificatio(010): 05C78. 1 Itrouctio We cosier oly simple, fiite, uirecte a o-trivial graph G = (V, E) with the vertex set V a the ege set E. The umber of elemets of V, eote as V is calle the orer of the graph G while the umber of elemets of E, eote as E is calle the size of the graph G. P (, k) eotes the geeralize Peterse graph. For various graph theoretic otatios a termiology we follow Gross a Yelle [3 whereas for umber theory we follow D. M. Burto [1. We will give brief summary of efiitios a other iformatio which are useful for the preset ivestigatios. Defiitio 1.1. For a graph G = (V, E) a fuctio f havig omai V, E or V E is sai to be a graph laebilg of G. If the omai is V, E or V E the the correspoig labelig is sai to be a vertex labelig, a ege labelig or a total labelig. For latest survey o graph labelig we refer to J. A. Gallia [. Vast amout of literature is available o ifferet types of graph labelig a more tha 1000 research papers have bee publishe so far i last four ecaes. The preset work is aime to iscuss oe such labelig kow as prime labelig. Defiitio 1.. A prime labelig of a graph G of orer is a ijective fuctio f : V {1,, 3,..., } such that for every pair of ajacet vertices u a v, gc(f(u), f(v)) = 1. The graph which amits prime labelig is calle a prime graph. 65
2 66 U. M. Prajapati a S. J. Gajjar al [6. The otio of a prime labelig was origiate by Etriger a was iscusse i a paper by Tout et Defiitio 1.3. The Geeralize Peterse graphsp (, k) with 3 a 1 k [ are efie to be a graph with V (P (, k)) = {v i, u i : 1 i } a E(P (, k)) = {v i v i+1, v i u i, u i u i+k : 1 i, subscripts moulo }. P (, k) has vertices a 3 eges. These graphs were itrouce by Coxeter(1950) a ame by Watkis(1969). Kh. M. Momiul Haque, Li Xiaohui, Yag Yuasheg a Zhao Pigzhog [4, 5 have prove that geeralize Peterse graph P (, 1) is prime for eve 500 a P (, 3) is prime for eve 100. Prime Labelig of Geeralize Peterso graph Theorem.1. P (, k) is ot a prime graph for o. Proof: Here the orer of P (, k) is. So we have to use 1 to itegers to label these vertices. Thus we have eve itegers. Now we ca assig eve umbers to at most 1 (as is o) vertices out of the outer rim vertices. Now out of ier vertices, every ier vertex is ajacet to at least oe other ier vertex. So we ca assig eve umbers to at most 1 (as is o) vertices out of the ( ier vertices. Thus we ca assig at most 1 = ) eve umbers to the vertices. But we have eve umbers, so it is ot possible. Thus P (, k) is ot a prime graph for o. Theorem.. If gc(, k) = the i P (, k) there are vertex isjoit ier cycles of orer, where. Proof: By the efiitio of P (, k), let v 1, v,..., v be the outer vertices, u 1, u,..., u be the ier vertices a E(P (, k)) = {v i v i+1, v i u i, u i u i+k : 1 i, subscripts moulo }. Thus every ier vertex u i is ajacet with ier vertex u i+k (subscript moulo ). Now costruct a sequece of vertices as follows: Let us start with u 1. By efiitio of P (, k), u 1 is ajacet with u 1+k, u 1+k is ajacet with u 1+k a so o. Thus we have a sequece u 1, u (1+k), u (1+k),..., u (1+ k) of ier vertices. This sequece repeats after steps as 1+ k 1(mo ). Also if 1+ik 1+jk ( mo ) for some i a j less tha, the (i j)k 0 ( mo ). Therefore, (i j)k 1 0 (mo 1 ). [As gc(, k) =, let = 1, k = k 1 a gc( 1, k 1 ) = 1. This implies that i j 0 ( mo 1 ) a hece i j ( mo 1 ), which is ot possible as i a j are istict a less tha = 1. Thus we have a cycle with orer whose vertex set is C 1 = {u 1, u (1+k),..., u (1+( 1)k) }. Now choose the smallest t such that u t / C 1 a costruct aother set C = {u t, u (t+k), u (t+k),..., u (t+( 1)k) } of ier vertices. Clearly o two vertices of C are same. Also C 1 a C are isjoit, as if possible let u (t+ik) = u (1+jk) for some i a j less tha. The t + ik 1 + jk ( mo ) which
3 Prime labelig of geeralize Peterse graph 67 implies that t 1 + (j i)k ( mo ). Therefore u t is a elemet of C 1 as j i is less tha, which cotraicts the choice of u t. Thus C 1 a C are isjoit sets. Now choose aother ier vertex which is ot i C 1 a C both a costruct a ew set as above. By repeatig this process times, we ca fi such sets of orer such that all the sets are pair wise isjoit. Thus we have isjoit ier cycles each with orer. Theorem.3. P (, k) is ot a prime graph if both a k are eve umbers. Proof: Let gc(, k) = the i P (, k) there is a outer cycle C a isjoit ier cycles C Case 1: Let [ be o. The we ca label at most vertices of each ier cycles C by eve umbers a we ca label at most vertices of outer cycle C by eve umbers. Thus the umber of vertices of P (, k) that ca be labele by eve umbers is [ +. Now [ + < + =. But we have eve umbers to label the vertices. So it is ot possible.. Case : Let be eve. Here we must have to label the vertices of outer cycle C alteratively by o a eve umbers. Also we must have to label half of the ier vertices by eve umbers a half by o umbers. Now choose a outer vertex say u which is labele by eve umber a fi the correspoig ier vertex say v which is ajacet to this outer vertex u. Let C be the ier cycle cotaiig the vertex v. The all the outer vertices which are ajacet with the vertices of this ier cycle C are labele by eve umbers as k is eve. So o vertices of this ier cycle C ca be label by eve umber. Thus prime labelig is ot possible i this case. Thus i each case P (, k) is ot a prime graph if both a k are eve umbers. Theorem.4. If geeralize Peterse graph P (, k) is prime the must be eve a k must be o. Theorem.4 follows from Theorem.1 a Theorem.3. Theorem.5. If for t, t + 1 is prime the geeralize Peterse graph P (, k) is a prime graph, where = t + a k = t Proof: Let v 1, v,..., v be the outer vertices a u 1, u,..., u be the ier vertices of P (, k). Now efie a fuctio f : V (P (, k)) {1,,..., } as follows: i for u = v i, 1 i t + ; t for u = u 1 ; t + 4i for u = u f(u) = (i 1), i =, 3,..., t + 1; t + 4i for u = u ( t 1 +i+1), i = 1,, 3,..., t ; t + 4i + 1 for u = u i, i = 1,, 3,..., t ; t + 4i 1 for u = u ( t 1 +i), i = 1,, 3,..., t + 1. Clearly f is a ijective fuctio. Let e be a arbitrary ege of P (, k). To prove f is a prime labelig of P (, k) we have the followig cases:
4 68 U. M. Prajapati a S. J. Gajjar Case 1: If e = vi vi+1, the gc(f (vi ), f (vi+1 )) = gc(i, i + 1) = 1, for i = 1,,..., t + 1. Case : If e = v1 vt +, the gc(f (v1 ), f (vt + )) = gc(1, t + ) = 1. Case 3: If e = v1 u1, the gc(f (v1 ), f (u1 )) = gc(1, t+1 + 4) = 1. Case 4: If e = v(i 1) u(i 1), the gc(f (vi 1 ), f (ui 1 )) = gc(i 1, t +4i ) = gc(i 1, t ) = 1 for i =, 3,..., t + 1. Case 5: If e = v(t 1 +i+1) u(t 1 +i+1), the gc(f (v(t 1 +i+1) ), f (u(t 1 +i+1) )) = gc(t 1 + i + 1, t + 4i) = gc(t 1 + i + 1, 1) = 1, for i =, 3,..., t. Case 6: If e = vi ui, the gc(f (vi ), f (ui )) = gc(i, t + 4i + 1) = gc(i, t + 1) = 1, as t + 1 is prime, for i = 1,,..., t. Case 7: If e = v(t 1 +i) u(t 1 +i), the gc(f (v(t 1 +i) ), f (u(t 1 +i) )) = gc(t 1 + i, t + 4i 1) = gc(t 1 + i, 1) = 1, for i = 1,,..., t + 1. Case 8: If e = u1 u(t 1 +), the gc(f (u1 ), f (u(t 1 +) )) = gc(t+1 +4, t +3) = gc(, t +3) = 1. Case 9: If e = u(i 1) u(t 1 +i), the gc(f (u(i 1) ), f (u(t 1 +i) )) = gc(t +4i, t +4i 1) = 1, for i =,..., t + 1. Case 10: If e = ui u(t 1 +i+1), the gc(f (ui ), f (u(t 1 +i+1) )) = gc(t + 4i + 1, t + 4i) = 1, for i = 1,,..., t. Thus P (, k) amits a prime labelig. So P (, k) is a prime graph for = t + a k = t 1 + 1, where t + 1 is prime. Illustratio.6. Prime labelig of the geeralize Peterse graph P (18, 9) is show i Figure 1. Figure 1: Prime labelig of geeralize Peterse graph P (18, 9). Theorem.7. If a are prime the geeralize Peterse graph P (4 +, + 1) is a prime graph. Proof: Let v1, v,..., v4+ be the outer vertices a u1, u,..., u4+ be the ier vertices of P (4+, + 1). Now efie a fuctio f : V (P (4 +, + 1)) {1,,..., 8 + 4} as follows:
5 Prime labelig of geeralize Peterse graph 69 4i + 1 for u = v (i+1), 0 i ; 8 4i + 4 for u = v (i+), 0 i 1; 4i + 4 for u = v (+i+), 0 i ; 8 4i + 1 for u = v f(u) = (+i+3), 0 i 1; 4i + for u = u (i+1), 0 i ; 8 4i + 3 for u = u (i+), 0 i 1; 4i + 3 for u = u (+i+), 0 i ; 8 4i + for u = u (+i+3), 0 i 1. Clearly f is a ijective fuctio. Let e be a arbitrary ege of P (4 +, + 1). To prove f is a prime labelig of P (4 +, + 1) we have the followig cases: Case 1: If e = v (i+1) v (i+), the gc(f(v (i+1) ), f(v (i+) )) = gc(4i + 1, 8 4i + 4) = gc(4i + 1, 8 + 5) = 1, for 0 i 1 as is prime. Case : If e = v (i+) v (i+3), the gc(f(v (i+) ), f(v (i+3) )) = gc(f(v (i+) ), f(v ((i+1)+1) )) = gc(8 4i + 4, 4i + 5) = gc(8 + 9, 4i + 5) = 1, for 0 i 1 as is prime. Case 3: If e = v (+1) v (+), the gc(f(v (+1) ), f(v (+) )) = gc(4 + 1, 4) = 1. Case 4: If e = v (+i+) v (+i+3), the gc(f(v (+i+) ), f(v (+i+3) )) = gc(4i + 4, 8 4i + 1) = gc(4i + 4, 8 + 5) = 1, for 0 i 1, as is prime. Case 5: If e = v (+i+3) v (+i+4), the for 0 i 1, gc(f(v (+i+3) ), f(v (+i+4) )) = gc(f(v (+i+3) ), f(v (+(i+1)+) )) = gc(8 4i + 1, 4i + 8) = gc(8 + 9, 4i + 8) = 1. ( as is prime). Case 6: If e = v (4+) v 1, the gc(f(v (4+) ), f(v 1 )) = gc(4 + 4, 1) = 1. Case 7: If e = v (i+1) u (i+1), the gc(f(v (i+1) ), f(u (i+1) )) = gc(4i + 1, 4i + ) = 1, for 0 i. Case 8: If e = v (i+) u (i+), the gc(f(v (i+) ), f(u (i+) )) = gc(8 4i + 4, 8 4i + 3) = 1, for 0 i 1. Case 9: If e = v (+i+) u (+i+), the gc(f(v (+i+) ), f(u (+i+) )) = gc(4i + 4, 4i + 3) = 1, for 0 i. Case 10: If e = v (+i+3) u (+i+3), the for 0 i 1, gc(f(v (+i+3) ), f(u (+i+3) )) = gc(8 4i + 1, 8 4i + ) = 1. Case 11: If e = u (i+1) u (+i+), the gc(f(u (i+1) ), f(u (+i+) )) = gc(4i +, 4i + 3) = 1, for 0 i. Case 1: If e = u (i+) u (+i+3), the gc(f(u (i+) ), f(u (+i+3) )) = gc(8 4i + 3, 8 4i + ) = 1, for 0 i 1. Thus, P (4 +, + 1) amits a prime labelig. So P (4 +, + 1) is a prime graph, where
6 70 U. M. Prajapati a S. J. Gajjar a are prime. Illustratio.8. Prime labelig of the geeralize Peterse graph P (6, 3) is show i Figure. Figure : Prime labelig of geeralize Peterse graph P (6, 3). Theorem.9. If + 1, a are prime the geeralize Peterse graph P (4 + 4, + 1) is a prime graph. Proof: Let v1, v,..., v4+4 be the outer vertices a u1, u,..., u4+4 be the ier vertices of P (4+ 4, + 1). Now efie a fuctio f : V (P (4 + 4, + 1)) {1,,..., 8 + 8} as follows: i for u = vi, 1 6 i ; i for u = u, 1 6 i 6 + ; i f (u) = i for u = u (+3+i), 1 6 i 6 ; i for u = u (i 1), i 6 +. Clearly f is a ijective fuctio. Let e be a arbitrary ege of P (4 +, + 1). To prove f is a prime labelig of P (4 +, + 1) we have the followig cases: Case 1: If e = vi vi+1, the for 1 6 i , gc(f (vi ), f (vi+1 )) = gc(i, i + 1) = 1. Case : If e = v(4+4) v1, the gc(f (v(4+4) ), f (v1 )) = gc(4 + 4, 1) = 1. Case 3: If e = ui u(+3+i), the gc(f (ui ), f (u(+3+i) )) = gc( i, i) = 1, for 1 6 i 6. Case 4: If e = ui u(i 1), the gc(f (ui ), f (u(i 1) ) = gc( i, i) = 1 for i 6 +. Case 5: If e = u(+3+i) u(i+), the gc(f (u(+3+i) ), f (u(i+) ) = gc(4+4+i, 4+5+i) = 1, for 1 6 i 6. Case 6: If e = u(i 1) u(i+), the gc(f (u(i 1) ), f (u(i+) ) = gc(4+4+i, 4+5+i) = 1, for i Case 7: If e = u(+3) u, the gc(f (u(+3) ), f (u ) = gc(8 + 8, 4 + 5) = gc(, 4 + 5) = 1. Case 8: If e = vi ui the gc(f (vi ), f (ui ) = gc(i, i) = gc(i, 4 + 3) = 1, for 1 6 i 6 + as is prime.
7 Prime labelig of geeralize Peterse graph 71 Case 9: If e = v(+3+i) u(+3+i), the gc(f (v(+3+i) ), f (u(+3+i) ) = gc( i, i) = gc( i, + 1) = gc( + i, + 1) = 1, for 1 6 i 6, as + 1 is prime. Case 10: If e = v(i 1) u(i 1), the gc(f (v(i 1) ), f (u(i 1) ) = gc(i 1, i) = gc(i 1, 6 + 5) = 1, for i 6 +, as is prime. Thus, P (4 + 4, + 1) amits a prime labelig. So P (4 + 4, + 1) is a prime graph, where + 1, a are prime. Illustratio.10. Prime labelig of geeralize Peterse graph P (8, 3) is show i Figure 3. Figure 3: Prime labelig of geeralize Peterse graph P (8, 3). Now we have the followig cojecture. Cojecture.11. If is eve, k is o a 1 6 k 6 is prime. hi the the geeralize Peterse graph P (, k) Ackowlegemet: The authors are highly thakful to the aoymous referee for valuable commets a costructive suggestios. Refereces [1 D. M. Burto, Elemetary Number Theory, Seco Eitio, [ J. A. Gallia, A Dyamic Survey of Graph Labelig, The Electroic Joural of Combiatorics, Vol. 19, 01. [3 J. Gross a J. Yelle, Habook of Graph Theory, CRC Press, 004. [4 Kh. M. Momiul Haque, Li Xiaohui, Yag Yuasheg a Zhao Pigzhog, O the Prime Labelig of Geeralize Peterse Graphs P (, 1), Utilitas Mathematica, I press. [5 Kh. M. Momiul Haque, Li Xiaohui, Yag Yuasheg a Zhao Pigzhog, O the Prime Labelig of Geeralize Peterse Graphs P (, 3), It. J. Cotemp. Math. Scieces, Vol. 6, No. 36(011), [6 A. Tout, A. N. Dabboucy a K. Howalla, Prime labelig of Graphs, Nat. Aca. Sci. Letters, Vol. 11(198),
ALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER Prove, or isprove a salvage: If K is a fiel, a f(x) K[x] has o roots, the K[x]/(f(x)) is a fiel. Couter-example: Cosier the fiel K = Q a the polyomial f(x) = x 4 + 3x 2 + 2.
More informationSparsification using Regular and Weighted. Graphs
Sparsificatio usig Regular a Weighte 1 Graphs Aly El Gamal ECE Departmet a Cooriate Sciece Laboratory Uiversity of Illiois at Urbaa-Champaig Abstract We review the state of the art results o spectral approximatio
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 informationOn triangular billiards
O triagular billiars Abstract We prove a cojecture of Keyo a Smillie cocerig the oexistece of acute ratioal-agle triagles with the lattice property. MSC-iex: 58F99, 11N25 Keywors: Polygoal billiars, Veech
More informationGaps between Consecutive Perfect Powers
Iteratioal Mathematical Forum, Vol. 11, 016, o. 9, 49-437 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/imf.016.63 Gaps betwee Cosecutive Perfect Powers Rafael Jakimczuk Divisió Matemática, Uiversia
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 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
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 informationTHE NUMBER OF IRREDUCIBLE POLYNOMIALS AND LYNDON WORDS WITH GIVEN TRACE
SIM J. DISCRETE MTH. Vol. 14, No. 2, pp. 240 245 c 2001 Society for Iustrial a pplie Mathematics THE NUMBER OF IRREDUCIBLE POLYNOMILS ND LYNDON WORDS WITH GIVEN TRCE F. RUSKEY, C. R. MIERS, ND J. SWD bstract.
More informationA Remark on Relationship between Pell Triangle and Zeckendorf Triangle
Iteratioal Joural of Pure a Applie Mathematics Volume 9 No. 5 8 3357-3364 ISSN: 34-3395 (o-lie versio) url: http://www.acapubl.eu/hub/ http://www.acapubl.eu/hub/ A Remark o Relatioship betwee Pell Triagle
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 informationONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS
ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS A.Maheswari 1, P.Padiaraj 2 1,2 Departet of Matheatics,Kaaraj College of Egieerig ad Techology, Virudhuagar (Idia) ABSTRACT A graph G
More informationModular orientations of random and quasi-random regular graphs
Moular orietatios of raom a quasi-raom regular graphs Noga Alo Pawe l Pra lat Abstract Exteig a ol cojecture of Tutte, Jaeger cojecture i 1988 that for ay fixe iteger p 1, the eges of ay 4p-ege coecte
More informationOn Net-Regular Signed Graphs
Iteratioal J.Math. Combi. Vol.1(2016), 57-64 O Net-Regular Siged Graphs Nuta G.Nayak Departmet of Mathematics ad Statistics S. S. Dempo College of Commerce ad Ecoomics, Goa, Idia E-mail: ayakuta@yahoo.com
More informationarxiv: v4 [math.co] 5 May 2011
A PROBLEM OF ENUMERATION OF TWO-COLOR BRACELETS WITH SEVERAL VARIATIONS arxiv:07101370v4 [mathco] 5 May 011 VLADIMIR SHEVELEV Abstract We cosier the problem of eumeratio of icogruet two-color bracelets
More information6.451 Principles of Digital Communication II Wednesday, March 9, 2005 MIT, Spring 2005 Handout #12. Problem Set 5 Solutions
6.51 Priciples of Digital Commuicatio II Weesay, March 9, 2005 MIT, Sprig 2005 Haout #12 Problem Set 5 Solutios Problem 5.1 (Eucliea ivisio algorithm). (a) For the set F[x] of polyomials over ay fiel F,
More informationAbelian Property of the Category of U-Complexes
Iteratioal Joural of Mathematical Aalysis Vol. 10, 2016, o. 17, 849-853 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.12988/ijma.2016.6682 Abelia Property of the Category of U-Complexes Gustia Elfiyati
More informationAsymptotic Formulae for the n-th Perfect Power
3 47 6 3 Joural of Iteger Sequeces, Vol. 5 0, Article.5.5 Asymptotic Formulae for the -th Perfect Power Rafael Jakimczuk Divisió Matemática Uiversidad Nacioal de Lujá Bueos Aires Argetia jakimczu@mail.ulu.edu.ar
More information= n which will be written with general term a n Represent this sequence by listing its function values in order:
Sectio 9.: Sequeces a Series (Sums) Remier:, 2, 3,, k 2, k, k, k +, k + 2, The ellipsis ots iicate the sequece is oeig, has ifiitely may terms. I. SEQUENCES Defiitio (page 706): A sequece is a fuctio whose
More informationProof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients
Proof of a cojecture of Amdeberha ad Moll o a divisibility property of biomial coefficiets Qua-Hui Yag School of Mathematics ad Statistics Najig Uiversity of Iformatio Sciece ad Techology Najig, PR Chia
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 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 informationON THE DIOPHANTINE EQUATION
Fudametal Joural of Mathematics ad Mathematical Scieces Vol., Issue 1, 01, Pages -1 This paper is available olie at http://www.frdit.com/ Published olie July, 01 ON THE DIOPHANTINE EQUATION SARITA 1, HARI
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 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 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 informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationWeighted Gcd-Sum Functions
1 3 47 6 3 11 Joural of Iteger Sequeces, Vol. 14 (011), Article 11.7.7 Weighte Gc-Sum Fuctios László Tóth 1 Departmet of Mathematics Uiversity of Pécs Ifjúság u. 6 764 Pécs Hugary a Istitute of Mathematics,
More informationCongruence Modulo a. Since,
Cogruece Modulo - 03 The [ ] equivalece classes refer to the Differece of quares relatio ab if a -b o defied as Theorem 3 - Phi is Periodic, a, [ a ] [ a] The period is Let ad a We must show ( a ) a ice,
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 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 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 informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationA note on equiangular tight frames
A ote o equiagular tight frames Thomas Strohmer Departmet of Mathematics, Uiversity of Califoria, Davis, CA 9566, USA Abstract We settle a cojecture of Joseph Rees about the existece a costructio of certai
More informationk=1 s k (x) (3) and that the corresponding infinite series may also converge; moreover, if it converges, then it defines a function S through its sum
0. L Hôpital s rule You alreay kow from Lecture 0 that ay sequece {s k } iuces a sequece of fiite sums {S } through S = s k, a that if s k 0 as k the {S } may coverge to the it k= S = s s s 3 s 4 = s k.
More informationDominating Sets and Domination Polynomials of Square Of Cycles
IOSR Joural of Mathematics IOSR-JM) ISSN: 78-78. Volume 3, Issue 4 Sep-Oct. 01), PP 04-14 www.iosrjourals.org Domiatig Sets ad Domiatio Polyomials of Square Of Cycles A. Vijaya 1, K. Lal Gipso 1 Assistat
More information1 = 2 d x. n x n (mod d) d n
HW2, Problem 3*: Use Dirichlet hyperbola metho to show that τ 2 + = 3 log + O. This ote presets the ifferet ieas suggeste by the stuets Daiel Klocker, Jürge Steiiger, Stefaia Ebli a Valerie Roiter for
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
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 informationA Note on the Kolmogorov-Feller Weak Law of Large Numbers
Joural of Mathematical Research with Applicatios Mar., 015, Vol. 35, No., pp. 3 8 DOI:10.3770/j.iss:095-651.015.0.013 Http://jmre.dlut.edu.c A Note o the Kolmogorov-Feller Weak Law of Large Numbers Yachu
More informationChapter 2 Transformations and Expectations
Chapter Trasformatios a Epectatios Chapter Distributios of Fuctios of a Raom Variable Problem: Let be a raom variable with cf F ( ) If we efie ay fuctio of, say g( ) g( ) is also a raom variable whose
More informationOn Divisibility concerning Binomial Coefficients
A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/
More informationTHE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS. Contents 1. History 1
THE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS VIKTOR MOROS Abstract. The zeta fuctio has bee studied for ceturies but mathematicias are still learig about it. I this paper, I will discuss some of the zeta
More informationii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.)
Sets 1 Math 3312 Set Theory Sprig 2008 Itroductio Set theory is a brach of mathematics that deals with the properties of welldefied collectios of objects, which may or may ot be of a mathematical ature,
More informationExponential function and its derivative revisited
Expoetial fuctio a its erivative revisite Weg Ki Ho, Foo Him Ho Natioal Istitute of Eucatio, Sigapore {wegki,foohim}.ho@ie.eu.sg Tuo Yeog Lee NUS High School of Math & Sciece hsleety@us.eu.sg February
More informationResearch Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property
Discrete Dyamics i Nature ad Society Volume 2011, Article ID 360583, 6 pages doi:10.1155/2011/360583 Research Article A Note o Ergodicity of Systems with the Asymptotic Average Shadowig Property Risog
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationFans are cycle-antimagic
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(1 (017, Pages 94 105 Fas are cycle-atimagic Ali Ovais Muhammad Awais Umar Abdus Salam School of Mathematical Scieces GC Uiversity, Lahore Pakista aligureja
More informationThe 4-Nicol Numbers Having Five Different Prime Divisors
1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 14 (2011), Article 11.7.2 The 4-Nicol Numbers Havig Five Differet Prime Divisors Qiao-Xiao Ji ad Mi Tag 1 Departmet of Mathematics Ahui Normal Uiversity
More informationRELATING THE RIEMANN HYPOTHESIS AND THE PRIMES BETWEEN TWO CUBES
RELATING THE RIEMANN HYPOTHESIS AND THE PRIMES BETWEEN TWO CUBES COPIL, Vlad Faculty of Mathematics-Iformatics, Spiru Haret Uiversity, vcopilmi@spiruharetro Abstract I this paper we make a evaluatio for
More informationHÖLDER SUMMABILITY METHOD OF FUZZY NUMBERS AND A TAUBERIAN THEOREM
Iraia Joural of Fuzzy Systems Vol., No. 4, (204 pp. 87-93 87 HÖLDER SUMMABILITY METHOD OF FUZZY NUMBERS AND A TAUBERIAN THEOREM İ. C. ANAK Abstract. I this paper we establish a Tauberia coditio uder which
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 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 informationOn Elementary Methods to Evaluate Values of the Riemann Zeta Function and another Closely Related Infinite Series at Natural Numbers
Global oural of Mathematical Sciece: Theory a Practical. SSN 97- Volume 5, Number, pp. 5-59 teratioal Reearch Publicatio Houe http://www.irphoue.com O Elemetary Metho to Evaluate Value of the Riema Zeta
More informationInteresting Series Associated with Central Binomial Coefficients, Catalan Numbers and Harmonic Numbers
3 47 6 3 Joural of Iteger Sequeces Vol. 9 06 Article 6.. Iterestig Series Associated with Cetral Biomial Coefficiets Catala Numbers ad Harmoic Numbers Hogwei Che Departmet of Mathematics Christopher Newport
More informationClassroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in
Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is
More informationOn a Conjecture of Dris Regarding Odd Perfect Numbers
O a Cojecture of Dris Regardig Odd Perfect Numbers Jose Araldo B. Dris Departmet of Mathematics, Far Easter Uiversity Maila, Philippies e-mail: jadris@feu.edu.ph,josearaldobdris@gmail.com arxiv:1312.6001v9
More informationDefinition 2 (Eigenvalue Expansion). We say a d-regular graph is a λ eigenvalue expander if
Expaer Graphs Graph Theory (Fall 011) Rutgers Uiversity Swastik Kopparty Throughout these otes G is a -regular graph 1 The Spectrum Let A G be the ajacecy matrix of G Let λ 1 λ λ be the eigevalues of A
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 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 informationRADIO NUMBER FOR CROSS PRODUCT P n (P 2 ) Gyeongsang National University Jinju, , KOREA 2,4 Department of Mathematics
Iteratioal Joural of Pure ad Applied Mathematics Volume 97 No. 4 014, 515-55 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v97i4.11
More informationRight circulant matrices with ratio of the elements of Fibonacci and geometric sequence
Notes o Number Theory ad Discrete Mathematics Prit ISSN 1310 5132, Olie ISSN 2367 8275 Vol. 22, 2016, No. 3, 79 83 Right circulat matrices with ratio of the elemets of Fiboacci ad geometric sequece Aldous
More informationAccepted in Fibonacci Quarterly (2007) Archived in SEQUENCE BALANCING AND COBALANCING NUMBERS
Accepted i Fiboacci Quarterly (007) Archived i http://dspace.itrl.ac.i/dspace SEQUENCE BALANCING AND COBALANCING NUMBERS G. K. Pada Departmet of Mathematics Natioal Istitute of Techology Rourela 769 008
More informationGeneralized Dynamic Process for Generalized Multivalued F-contraction of Hardy Rogers Type in b-metric Spaces
Turkish Joural of Aalysis a Number Theory, 08, Vol. 6, No., 43-48 Available olie at http://pubs.sciepub.com/tjat/6// Sciece a Eucatio Publishig DOI:0.69/tjat-6-- Geeralize Dyamic Process for Geeralize
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
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 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 informationPell and Lucas primes
Notes o Number Theory ad Discrete Mathematics ISSN 30 532 Vol. 2, 205, No. 3, 64 69 Pell ad Lucas primes J. V. Leyedekkers ad A. G. Shao 2 Faculty of Sciece, The Uiversity of Sydey NSW 2006, Australia
More informationLecture #3. Math tools covered today
Toay s Program:. Review of previous lecture. QM free particle a particle i a bo. 3. Priciple of spectral ecompositio. 4. Fourth Postulate Math tools covere toay Lecture #3. Lear how to solve separable
More informationResearch Article A Limit Theorem for Random Products of Trimmed Sums of i.i.d. Random Variables
Joural of Probability a Statistics Volume 2, Article ID 849, 3 ages oi:.55/2/849 Research Article A Limit Theorem for Raom Proucts of Trimme Sums of i.i.. Raom Variables Fa-mei Zheg School of Mathematical
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationECE 308 Discrete-Time Signals and Systems
ECE 38-5 ECE 38 Discrete-Time Sigals ad Systems Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa ECE 38-5 1 Additio, Multiplicatio, ad Scalig of Sequeces Amplitude Scalig: (A Costat
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 informationMath 216A Notes, Week 3
Math 26A Notes Week 3 Scrie: Parker Williams Disclaimer: These otes are ot early as polishe (a quite possily ot early as correct as a pulishe paper. Please use them at your ow risk.. Posets a Möius iversio
More informationAnalytic Number Theory Solutions
Aalytic Number Theory Solutios Sea Li Corell Uiversity sl6@corell.eu Ja. 03 Itrouctio This ocumet is a work-i-progress solutio maual for Tom Apostol s Itrouctio to Aalytic Number Theory. The solutios were
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 informationSigma notation. 2.1 Introduction
Sigma otatio. Itroductio We use sigma otatio to idicate the summatio process whe we have several (or ifiitely may) terms to add up. You may have see sigma otatio i earlier courses. It is used to idicate
More informationAN APPLICATION OF G d -METRIC SPACES AND METRIC DIMENSION OF GRAPHS
Iteratioal Joural o Applicatios of raph Theor i Wireless A hoc Networks a Sesor NetworksRAPH-HOC Vol.7 No. March 05 AN APPLICATION OF -METRIC SPACES AND METRIC DIMENSION OF RAPHS Ms. Mausha R a Dr. Su
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationA q-analogue of some binomial coefficient identities of Y. Sun
A -aalogue of some biomial coefficiet idetities of Y. Su arxiv:008.469v2 [math.co] 5 Apr 20 Victor J. W. Guo ad Da-Mei Yag 2 Departmet of Mathematics, East Chia Normal Uiversity Shaghai 200062, People
More informationResearch Article Approximate Riesz Algebra-Valued Derivations
Abstract ad Applied Aalysis Volume 2012, Article ID 240258, 5 pages doi:10.1155/2012/240258 Research Article Approximate Riesz Algebra-Valued Derivatios Faruk Polat Departmet of Mathematics, Faculty of
More informationInhomogeneous Poisson process
Chapter 22 Ihomogeeous Poisso process We coclue our stuy of Poisso processes with the case of o-statioary rates. Let us cosier a arrival rate, λ(t), that with time, but oe that is still Markovia. That
More information(average number of points per unit length). Note that Equation (9B1) does not depend on the
EE603 Class Notes 9/25/203 Joh Stesby Appeix 9-B: Raom Poisso Poits As iscusse i Chapter, let (t,t 2 ) eote the umber of Poisso raom poits i the iterval (t, t 2 ]. The quatity (t, t 2 ) is a o-egative-iteger-value
More informationA generalization of the Leibniz rule for derivatives
A geeralizatio of the Leibiz rule for erivatives R. DYBOWSKI School of Computig, Uiversity of East Loo, Docklas Campus, Loo E16 RD e-mail: ybowski@uel.ac.uk I will shamelessly tell you what my bottom lie
More informationOn Second Order Additive Coupled Fibonacci Sequences
MAYFEB Joural of Mathematics O Secod Order Additive Coupled Fiboacci Sequeces Shikha Bhatagar School of Studies i Mathematics Vikram Uiversity Ujjai (M P) Idia suhai_bhatagar@rediffmailcom Omprakash Sikhwal
More informationThe value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng
The value of Baach limits o a certai sequece of all ratioal umbers i the iterval 0, Bao Qi Feg Departmet of Mathematical Scieces, Ket State Uiversity, Tuscarawas, 330 Uiversity Dr. NE, New Philadelphia,
More informationResearch Article On Some Bounds and Exact Formulae for Connective Eccentric Indices of Graphs under Some Graph Operations
Iteratioal Combiatorics, Article ID 57957, 5 pages http://xoiorg/055/04/57957 Research Article O Some Bous a Exact Formulae for Coective Eccetric Iices of Graphs uer Some Graph Operatios Nilaja De, Aita
More informationResearch Article Some E-J Generalized Hausdorff Matrices Not of Type M
Abstract ad Applied Aalysis Volume 2011, Article ID 527360, 5 pages doi:10.1155/2011/527360 Research Article Some E-J Geeralized Hausdorff Matrices Not of Type M T. Selmaogullari, 1 E. Savaş, 2 ad B. E.
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
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 informationOn the Spectrum of Unitary Finite Euclidean Graphs
ESI The Erwi Schrödiger Iteratioal Boltzmagasse 9 Istitute for Mathematical Physics A-1090 Wie, Austria O the Spectrum of Uitary Fiite Euclidea Graphs Si Li Le Ah Vih Viea, Preprit ESI 2038 (2008) July
More informationProof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun
Proof of two ivisibility properties of bioial coefficiets cojecture by Z.-W. Su Victor J. W. Guo Departet of Matheatics Shaghai Key Laboratory of PMMP East Chia Noral Uiversity 500 Dogchua Roa Shaghai
More informationON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv: v1 [math.co] 2 Jan 2019
ON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv:1901.00355v1 [math.co] Ja 019 TAYO CHARLES ADEFOKUN 1 AND DEBORAH OLAYIDE AJAYI Abstract. A Stacked-book graph G m, results from the Cartesia product of a stargraphs
More informationTHE LONELY RUNNER PROBLEM FOR MANY RUNNERS. Artūras Dubickas Vilnius University, Lithuania
GLASNIK MATEMATIČKI Vol. 46(66)(2011), 25 30 THE LONELY RUNNER PROBLEM FOR MANY RUNNERS Artūras Dubickas Vilius Uiversity, Lithuaia Abstract. The loely ruer cojecture asserts that for ay positive iteger
More informationMATH 6101 Fall Problems. Problems 11/9/2008. Series and a Famous Unsolved Problem (2-1)(2 + 1) ( 4) 12-Nov-2008 MATH
/9/008 MATH 60 Fall 008 Series ad a Famous Usolved Problem = = + + + + ( - )( + ) 3 3 5 5 7 7 9 -Nov-008 MATH 60 ( 4) = + 5 48 -Nov-008 MATH 60 3 /9/008 ( )! = + -Nov-008 MATH 60 4 3 4 5 + + + + + + +
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationM-Quasihyponormal Composition Operators. on Weighted Hardy Spaces
It. Joural of Math. Aalysis, Vol., 8, o. 4, 1163-117 M-Quasihypoormal ompositio Operators o Weighted Hardy Spaces S. Paayappa Departmet of Mathematics, Govermet Arts ollege oimbatore 641 18, amil Nadu,
More informationAbstract. Keywords: conjecture; divisor function; divisor summatory function; prime numbers; Dirichlet's divisor problem
A ew cojecture o the divisor summatory fuctio offerig a much higher predictio accuracy tha Dirichlet's divisor problem approach * Wiki-like trasdiscipliary article (Ope developmet iterval: 28 -?) - workig
More informationResearch Article A New Second-Order Iteration Method for Solving Nonlinear Equations
Abstract ad Applied Aalysis Volume 2013, Article ID 487062, 4 pages http://dx.doi.org/10.1155/2013/487062 Research Article A New Secod-Order Iteratio Method for Solvig Noliear Equatios Shi Mi Kag, 1 Arif
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 information