Modulo Magic Labeling in Digraphs
|
|
- Reynold Patterson
- 6 years ago
- Views:
Transcription
1 Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 Avalable free onlne at Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar Babujee, Department of Mathematcs, Anna Unversty Chenna , Inda E-mal: shobana_0@yahoo.com E-mal: baskarbabujee@yahoo.com (Receved: 5-6- / Accepted: 0-6-3) Abstract In ths paper we ntroduce and study a new type of labelng called Modulo Magc Labelng. Keywords: Dgraphs, Congruence relaton, Cycles, Path, Labelng. Introducton A drected graph G = (V,E) conssts of a fnte set V of ponts (vertex) and a collecton of ordered par of dstnct ponts called lnes (edges). Any such par ( u, v) s called an arc or drected lne (edge) and wll usually be denoted by uv. The edge uv goes from u to v and ncdent wth u and v. An edge connects a vertex to tself s called a loop. Let us consder the set H to be H = { 0,,,3,..., n }. We consder the drected graph whose vertces are the elements of H and such that there exsts exactly one drected edge from a to b f and only f t satsfes the congruence relaton. A cycle of length s called a fxed pont. Denote by d(a) the number of drected edges comng to a and a) the number of drected edges leavng the vertex a H = { 0,,,3,..., n }.. Of course
2 6 L. Shobana et al. d(a) 0 and od (a) =. For an solated fxed pont, the n-degree and the outdegree are both equal to. In the followng sectons we show some connecton between congruence relaton and graph labelng motvated by results of M.Krzek and L.Somer gven n [8] and n [9] as well as by the results of S.Bryant[5], G.Chasse[6], T.D.Rogers[], L.Szalay[] and Joanna Skowronek-Kazow[7]. The followng defntons are taken from [0] and [3]. Defnton.: Let G be a graph wth p vertces and q edges. Assume that the vertces and edges of G are labeled by,, 3... p + q such that each label s used exactly once. We defne the valence e) of an edge e to the sum of the label of e plus the two labels of the vertces ncdent wth e. Defnton.: If a labelng of G s possble such that the valence e) for each e s constant, we call the graph G edge-magc. And f t s possble that all the valences of the edge are dstnct, we call G edge-antmagc. Defnton.3: Let the edges of a graph G be labeled by,,..., q, and we call the sum of all the labels of the edges ncdent wth a vertex P the valence P) of P. If t s possble that all of the valences of the vertces n G are dstnct, the graph G s called antmagc. Defnton.4: A graph G(p, q) s sad to be (, ) vertex-magc wth the common vertex count k f there exsts a bjecton f : V(G) E(G) {,..., p + q} such that for each u V(G), f(u) + e f(e) = k for all e = (u, v) E(G) wth v V (G). It s sad to be (,) vertex- antmagc f f(u) + e f(e) are dstnct for all e = (u, v) E(G) wth v V(G). (, ) vertex magc labelng can also be sad as vertex magc total labelng. Modulo Magc Labelng In ths secton we ntroduce the concept of modulo magc labelng for some congruence relatons wth constant valence n-. The out-degree of a vertex v s the number of edges gong away from v n a drected graph and s denoted by v ). The valence of v ) s the sum of the out degree labels of edges from v plus the label of v. Defnton.: Let G be a drected graph wth = { 0,,,3,..., n } bjectve functon : V E { 0,,,3,..., n } V and a f s sad to be a modulo magc labelng wth common count k, f f ( u) + f ( uv) = k uv E or val ( od (u) ) s a constant k.
3 Modulo Magc Labelng n Dgraphs 7 Theorem.: If G(V,E) be a drected graph wth = { 0,,,..., n } V and edge set ab E f and only f arb when R : a + b mod n admts modulo magc labelng. Proof: Let G = ( V, E ) be a graph wth vertex set = { 0,,,3,..., n } V and the edge set s defned by the relaton a + b mod n. Consder a bjectve functon f : V E {0,,,..., n, n,...,n } defned by f ( v ) = ; 0 n and the edge set s gven by { vv+ ; 0 n } { v 0 v } E. The edge labelng s defned by = n f ( v v+ ) = n ; 0 n and f ( v n v0 ) = n. The valence of out-degree of the vertex v s denoted by val ( od ( v )). For every, v )) = f ( v ) + f ( v v + ); 0 n = + n = n vn )) = f ( vn ) + f ( vn v0 ) = n + n = n Hence the drected cycle graph obtaned by the relaton modulo magc labelng wth constant value n. a + bmod n admts Theorem.3: If G(V,E) be a dsconnected drected cycle graph wth { 0,,,..., } V = n and edge set ab E f and only f arb when R : a + b mod n admts modulo magc labelng. Proof: Let G = ( V, E) be a graph wth vertex set = { 0,,,3,..., n } V and the edge set s defned by the relaton a + b mod n. Consder a functon f : V E {0,,,..., n, n,...,n } where f ( v ) = ; 0 n. We now proceed wth the followng two cases. Case : When n 0 mod Let G = ( V, E) be a dsconnected graph. The two drected cycle graphs obtaned from the relaton s symmetrc. The edge set s defned by { vn v 0 } { vn } E = E where E = { v v + ; 0 ( n 4) / } and E v
4 8 L. Shobana et al. E = { v v + ; ( n )/ }. The edge labelng are gven by f ( v v ) =n--; 0 ( n 4)/ + f( v v + )=n-; ( n )/ f ( vn v0) = n + f vn v = n ( ) v )) = f ( v ) + f ( vv+ ); 0 ( n 4)/ = + n = n v+ )) = f ( v ) + f ( v v+ ); ( n )/ = + n = n vn )) = f ( vn ) + f ( vn v0 ) = n + n + = n vn )) = f ( vn ) + f ( vn v) = n + n = n Case : When n mod Let G ( V, E) = be a connected cycle graph. The edge set s defned by { vn v 0 } { vn } E = { v v v. The edge labelng s gven by + ; 0 n 3} f ( v v ) = n ;0 3 + n f ( vn v0) = n + f vn v = n ( ) v )) = f ( v ) + f ( vv+ ); 0 n 3 = + n = n vn )) = f ( vn ) + f ( vn v0 ) = n + n +
5 Modulo Magc Labelng n Dgraphs 9 = n vn )) = f ( vn ) + f ( vn v) = n + n = n Hence the drected cycle graph obtaned by the relaton magc labelng wth constant valence n a + bmodn admts modulo Example.4: The followng fgure shows a drected graph for the congruence relaton a 7 + b mod0 whch has modulo magc labelng wth constant valence 9. 7 Fg : Modulo magc labelng for a + b mod 0 Observaton.5: Let ( V, E) G = be a graph wth vertex set V ={ 0,,,.,n- } and the edge set s defned by the relaton a m + k b mod n where m, k and n are postve ntegers. Let f : V E {0,,,..., n, n,...,n } defned by f ( v ) = ; 0 n. Let us assume that a m + k b mod n and a m + k c mod n. a m + k b = nx and a m + k c = ny where x and y are postve ntegers. a m + k = b + nx and a m + k = c + ny b + nx = c + ny b c = n( y x) b c mod n. Therefore the out-degree for all the vertces n the drected graph s one. Now the edge labels are defned n such a way that the out degree from v ; 0 n wll
6 0 L. Shobana et al. receve the edge labels n the descendng from n- to n respectvely. Therefore when we sum the vertex wth ther correspondng edge labels we get a constant value n- whch leads to the modulo magc labelng. 3 Modulo Bmagc Labelng In ths secton we ntroduce the concept of modulo bmagc labelng for some congruence relatons. The n-degree of a vertex v s the number of edges comng towards v n a drected graph and s denoted by d(v ). The valence of d(v ) s the sum of the n-degree labels of the vertces v j for some j. Defnton 3.: Let V = { 0,,,3,..., n }. A drected graph G(V,E) s sad to have modulo bmagc labelng wth common count 0 or k, f there exst a bjecton f : V V such that f ( v) = 0 or k uv E. uv Example 3.: The followng fgure shows a drected graph for the congruence relaton a b mod3 whch admts modulo bmagc labelng. Fg : Modulo bmagc labelng for a b(mod 3) Theorem 3.3: If G (V, E) be a drected graph wth V { 0,,,..., n } = and edge set ab E f and only f arb when R : a b mod n admts modulo bmagc labelng only when n s prme. Proof: Let V { 0,,..., n } = be the vertces of the dgraph where n s any prme greater than two. The edges of the graph s defned by the relaton a b(mod n). The graph obtaned wth ths relaton s a dsconnected graph whch s ether a path or a cycle, for whch the n- degree sum of every vertex s ether 0 or n. The
7 Modulo Magc Labelng n Dgraphs pendant vertces have ndegree zero and all the nternal vertces have n degree and 0 s always an solated fxed pont. Let us assume that a b mod n and a c mod n. a b = nk and a c = nm where k and m are postve ntegers. a = b + nk and a = c + nm b + nk = c + nm b c = n( m k) b c mod n whch shows that the out-degree s always one. Consder an arbtrary vertex x whose n degree s. Let u and v be the vertces such that ux, vx E and f ( u) + f ( v) = n where u, v V. Let f ( u) = a, f ( v) = a and f ( x) = b say, then a b mod n () a b mod n. () We need to prove that a + a =. From () and () we nfer that n a a mod n (3) a a 0 mod n a a = kn ( a )( a a a + ) = kn where k s any nteger. From (3) t s clear that a + a = n where a a = k. The vertex labeled wth 0 s an solated fxed pont whose ndegree vertex sum s always 0.Therefore the graph obtaned by the relaton R admts (, 0) modulo bmagc labelng wth two constants 0 and n. Observaton 3.4: A component of the teraton dgraph s a subdgraph whch s a maxmal connected subgraph of the symmetrzaton of ths dgraph. The dgraph G(n) s called symmetrc f ts set of components can be splt nto two sets n such a way that there exsts a bjecton between these two sets such that the correspondng dgraphs are somorphc[8]. Consder the dgraph obtaned by the congruence relaton a + b mod n for n 0. when n s even, the dgraph obtaned by the relaton s symmetrc except when n=8. When n s odd, we get a connected dgraph except for n=5 and 9.
8 L. Shobana et al. 4 Concluson The dgraph constructed from some congruence relatons satsfes the modulo magc labelng and modulo bmagc labelng. In ths smlar way, one can construct and analyze the propertes of the dgraph obtaned from the congruence relatons and also ft the sutable labelng to t. References [] J.B. Babujee, Bmagc labelng n path graphs, The Mathematcs Educaton, 38() (004), -6. [] J.B. Babujee and N.P. Rao, Labelngs n dgraph, Journal of the Mathematcs Educaton, 39() (005), [3] J.B. Babujee and L. Shobana, Dgraphs arsng from number theory, Indan Journal of Mathematcs and Mathematcal Scences, 5() (Dec) (009), [4] J.B. Babujee and L. Shobana, Graph from relatons and ts labelng, European Journal of Scentfc Research, 64(3) (0), [5] S. Bryant, Groups, graphs and Fermat s last theorem, Amer. Math. Monthly, 74(967), [6] G. Chasse, Combnatoral cycles of a polynomal map over a commutatve feld, Dscrete Math., 6(986), -6. [7] J. Skowronek-Kazow, Some dgraphs arsng from number theory and remarks on the zero-dvsor graph of the rng z n, Informaton Processng Letters, 08 (3)(008), [8] M. Krzek and L. Somer, On a connecton of number theory wth graph theory, Czechoslovak Math. J., 54(9) (004), [9] M. Krzek and L. Somer, Sophe German lttle suns, Math. Slovaca, 54(004), [0] G. Rngel, Another tree conjecture, Utltas Matematca, 53(998), [] T.D. Rogers, The graph of the square mappng on the prme felds, Dscrete Math., 48(996), [] L. Szalay, A dscrete teraton n number theory, BDTF Tud. Kozl., 8(99), 7-9 (n Hungaran). [3] V. Yegnanarayanan, On magc graphs, Utltas Matematca, 59(00), [4] W.D. Walls, Magc Graphs, Brkhauser, (000).
Commentationes Mathematicae Universitatis Carolinae
Commentatones Mathematcae Unverstats Carolnae Uzma Ahmad; Syed Husnne Characterzaton of power dgraphs modulo n Commentatones Mathematcae Unverstats Carolnae, Vol. 52 (2011), No. 3, 359--367 Persstent URL:
More informationDiscrete Mathematics
Dscrete Mathematcs 32 (202) 720 728 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc On the symmetrc dgraphs from powers modulo n Guxn Deng
More informationZ 4p - Magic labeling for some special graphs
Internatonal Journal of Mathematcs and Soft Computng Vol., No. (0, 6-70. ISSN Prnt : 49-8 Z 4p - Magc labelng for some specal graphs ISSN Onlne: 9-55 V.L. Stella Arputha Mary Department of Mathematcs,
More informationPAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2
Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 3 2017, 489-499 ISSN: 1311-8080 (prnted verson); ISSN: 1314-3395 (on-lne verson) url: http://www.jpam.eu do: 10.12732/jpam.v1133.11 PAjpam.eu
More informationVertex Graceful Labeling-Some Path Related Graphs
Internatonal J.Math. Combn. Vol.3013), 44-49 Vertex Graceful Labelng-Some Path Related Graphs P.Selvaraju 1, P.Balaganesan and J.Renuka 3 1 Department of Mathematcs, Vel Tech Engneerng College, Avad, Chenna-
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationK-Total Product Cordial Labelling of Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 93-9466 Vol. 7, Issue (December ), pp. 78-76 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) K-Total Product Cordal Labellng o Graphs
More informationEXPANSIVE MAPPINGS. by W. R. Utz
Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationResearch Article On Simple Graphs Arising from Exponential Congruences
Appled Mathematcs Volume 2012, Artcle ID 292895, 10 pages do:10.1155/2012/292895 Research Artcle On Smple Graphs Arsng from Exponental Congruences M. Aslam Malk and M. Khald Mahmood Department of Mathematcs,
More informationA Classification of Cyclic Nodes and Enumeration of Components of a Class of Discrete Graphs
Appl. Math. Inf. Sc. 9, No. 1, 103-11 015) 103 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.1785/ams/090115 A Classfcaton of Cyclc Nodes and Enumeraton of Components
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationarxiv: v1 [math.co] 7 Apr 2015
Ranbow connecton n some dgraphs Jesús Alva-Samos 1 Juan José Montellano-Ballesteros Abstract arxv:1504.0171v1 [math.co] 7 Apr 015 An edge-coloured graph G s ranbow connected f any two vertces are connected
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationSMARANDACHE-GALOIS FIELDS
SMARANDACHE-GALOIS FIELDS W. B. Vasantha Kandasamy Deartment of Mathematcs Indan Insttute of Technology, Madras Chenna - 600 036, Inda. E-mal: vasantak@md3.vsnl.net.n Abstract: In ths aer we study the
More informationSome Star and Bistar Related Divisor Cordial Graphs
Annals o Pure and Appled Mathematcs Vol. 3 No. 03 67-77 ISSN: 79-087X (P) 79-0888(onlne) Publshed on 3 May 03 www.researchmathsc.org Annals o Some Star and Bstar Related Dvsor Cordal Graphs S. K. Vadya
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationOn intransitive graph-restrictive permutation groups
J Algebr Comb (2014) 40:179 185 DOI 101007/s10801-013-0482-5 On ntranstve graph-restrctve permutaton groups Pablo Spga Gabrel Verret Receved: 5 December 2012 / Accepted: 5 October 2013 / Publshed onlne:
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More informationJ. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES
J. Number Theory 30(200, no. 4, 930 935. SOME CURIOUS CONGRUENCES MODULO PRIMES L-Lu Zhao and Zh-We Sun Department of Mathematcs, Nanjng Unversty Nanjng 20093, People s Republc of Chna zhaollu@gmal.com,
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationErdős-Burgess constant of the multiplicative semigroup of the quotient ring off q [x]
Erdős-Burgess constant of the multplcatve semgroup of the quotent rng off q [x] arxv:1805.02166v1 [math.co] 6 May 2018 Jun Hao a Haol Wang b Lzhen Zhang a a Department of Mathematcs, Tanjn Polytechnc Unversty,
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationD.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS
D.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS SUB: ALGEBRA SUB CODE: 5CPMAA SECTION- A UNIT-. Defne conjugate of a n G and prove that conjugacy s an equvalence relaton on G. Defne
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationOn Graphs with Same Distance Distribution
Appled Mathematcs, 07, 8, 799-807 http://wwwscrporg/journal/am ISSN Onlne: 5-7393 ISSN Prnt: 5-7385 On Graphs wth Same Dstance Dstrbuton Xulang Qu, Xaofeng Guo,3 Chengy Unversty College, Jme Unversty,
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 6 Luca Trevisan September 12, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 6 Luca Trevsan September, 07 Scrbed by Theo McKenze Lecture 6 In whch we study the spectrum of random graphs. Overvew When attemptng to fnd n polynomal
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationSome Concepts on Constant Interval Valued Intuitionistic Fuzzy Graphs
IOS Journal of Mathematcs (IOS-JM) e-issn: 78-578, p-issn: 39-765X. Volume, Issue 6 Ver. IV (Nov. - Dec. 05), PP 03-07 www.osrournals.org Some Concepts on Constant Interval Valued Intutonstc Fuzzy Graphs
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationVASANTI N BHAT-NAYAK and UJWALA N DESHMUKH*
Proc. ndan Acad. Sc. (Math. Sc.), Vol. 106, No. 2, May 1996, pp. 201-216. 9 Prnted n nda New famles of graceful banana trees VASAN N BHA-NAYAK and UJWALA N DESHMUKH* Department of Mathematcs, Unversty
More informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationNeutrosophic Bi-LA-Semigroup and Neutrosophic N-LA- Semigroup
Neutrosophc Sets Systems, Vol. 4, 04 9 Neutrosophc B-LA-Semgroup Neutrosophc N-LA- Semgroup Mumtaz Al *, Florentn Smarache, Muhammad Shabr 3 Munazza Naz 4,3 Department of Mathematcs, Quad--Azam Unversty,
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationMODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS
The 3 rd Internatonal Conference on Mathematcs and Statstcs (ICoMS-3) Insttut Pertanan Bogor, Indonesa, 5-6 August 28 MODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS 1 Deky Adzkya and 2 Subono
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationCrystal monoids. Robert Gray (joint work with A. J. Cain and A. Malheiro) AAA90: 90th Workshop on General Algebra Novi Sad, 5th June 2015
Crystal monods Robert Gray (jont work wth A. J. Can and A. Malhero) AAA90: 90th Workshop on General Algebra Nov Sad, 5th June 05 Plactc monod va Knuth relatons Defnton Let A n be the fnte ordered alphabet
More informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationSPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS
SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS ROBERT S. COULTER AND TODD GUTEKUNST Abstract. Ths artcle ntroduces a new approach to studyng dfference sets
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationOn Tiling for Some Types of Manifolds. and their Folding
Appled Mathematcal Scences, Vol. 3, 009, no. 6, 75-84 On Tlng for Some Types of Manfolds and ther Foldng H. Rafat Mathematcs Department, Faculty of Scence Tanta Unversty, Tanta Egypt hshamrafat005@yahoo.com
More informationThe probability that a pair of group elements is autoconjugate
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 126, No. 1, February 2016, pp. 61 68. c Indan Academy of Scences The probablty that a par of group elements s autoconjugate MOHAMMAD REZA R MOGHADDAM 1,2,, ESMAT
More informationThe Pseudoblocks of Endomorphism Algebras
Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationCounterexamples to the Connectivity Conjecture of the Mixed Cells
Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationOn the average number of divisors of the sum of digits of squares
Notes on Number heory and Dscrete Mathematcs Prnt ISSN 30 532, Onlne ISSN 2367 8275 Vol. 24, 208, No. 2, 40 46 DOI: 0.7546/nntdm.208.24.2.40-46 On the average number of dvsors of the sum of dgts of squares
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationZhi-Wei Sun (Nanjing)
Acta Arth. 1262007, no. 4, 387 398. COMBINATORIAL CONGRUENCES AND STIRLING NUMBERS Zh-We Sun Nanng Abstract. In ths paper we obtan some sophstcated combnatoral congruences nvolvng bnomal coeffcents and
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More information