Vertex Odd Divisor Cordial Labeling of Graphs
|
|
- Marilynn Watts
- 5 years ago
- Views:
Transcription
1 IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. Vertex Odd Dvsor Cordal Labelg of Graphs ISSN A. Muthaya ad P. Pugaleth Assstat Professor, P.G. ad Research Departmet of Mathematcs, Govt. Arts College, Aryalur 6,Taml Nadu, Ida. Research Scholar, P.G. ad Research Departmet of Mathematcs, Govt. Arts College, Aryalur 6,Taml Nadu, Ida. Abstract I ths paper, the vertex odd dvsor cordal labelg of wheel graph W, swtchg of a pedet vertex path P, swtchg of a vertex cycle C, Bstar B, S( ), B, DS(B ), S (B ) ad < (), preseted., () (), > are eywords: Dvsor Cordal labelg, Dvsor Cordal Graphs, Vertex Odd Dvsor Cordal labelg, Vertex Odd Square Dvsor Cordal Graphs.. Itroducto By a graph, we mea a fte, udrected graph wthout loops ad multple edges, for terms ot defed here, we refer to Harary [4]. For stadard termology ad otatos related to umber theory we refer to Burto [] ad graph labelg, we refer to Galla []. I [], Caht troduce the cocept of cordal labelg of graph. I [], Varatharaja et al. troduce the cocept of dvsor cordal labelg of graph. The dvsor cordal labelg of varous types of graph are preseted [-8, 0-]. I [], Muthaya et al troduce vertex odd dvsor cordal labelg of graph. Further they proved path, cycle,,,,m, helm H, flower Fl, <, (), () >, swtchg of the apex vertex helm H ad S ( ) are vertex odd dvsor cordal graphs uder some codtos. Every dvsor cordal graphs eed ot be vertex odd dvsor cordal graphs. Also, every vertex odd dvsor cordal graphs eed ot be dvsor cordal graphs. The bref summares of defto whch are ecessary for the preset vestgato are provded below.. Deftos Defto :. A graph labelg s the assgmet of uque detfers to the edges ad vertces of a graph. Defto :. A mappg f :V(G) {0,} s called bary vertex labelg of G ad f(v) s called the label of the vertex v of G uder f. If for a edge e = uv, the duced edge labelg f* : E(G) {0,} s gve by f*(e) = f(u) f(v). The v f () = umber of vertces of havg label uder f ad e f () = umber of edges of havg label uder f*. A bary vertex labelg f of a graph G s called a cordal labelg f v f (0) v f () ad e f (0) e f (). A graph G s cordal f t admts cordal labelg. Defto :. Let a ad b be two tegers. If a dvdes b meas that there s a postve teger k such that b = ka. It s deoted by a b. If a does ot dvde b, the we deote a b. Defto :.4 Let G = (V(G), E(G)) be a smple graph ad f : V(G) {,,..., V(G) } be a bjecto. For each edge uv, assg the label f f(u) f(v) or f(v) f(u) ad the label 0 otherwse. The fucto f s called a dvsor cordal labelg f e f (0) e f (). A graph wth a dvsor cordal labelg s called a dvsor cordal graph. Defto :. Let G = (V(G), E(G)) be a smple graph wth vertces ad f : V {,,, } be a bjecto. For each edge uv, assg the label f ether f(u) f(v) or f(v) f(u) ad the label 0 otherwse. f s called a vertex odd dvsor cordal labelg f e f (0) e f (). A graph wth vertex odd dvsor cordal labelg s called a vertex odd dvsor cordal graph. Defto :.6 The jo G = G +G of graphs G ad G wth dsjot vertex sets V ad V, ad edge sets E ad E, s the graph uo G G together wth all the edges jog
2 IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. V ad V. A wheel graph W s defed as C +, where C deotes the cycle wth vertces. ISSN vertex x m where m t ad G has t(+) vertces ad t(+) edges. Defto :. For a graph G the splttg graph S (G) of a graph G s obtaed by addg a ew vertex v correspodg to each vertex v of G such that N(v) = N(v ). Defto :.8 Let G = (V(G), E(G)) be a graph wth vertex set V = S S S T where each S s a set of vertces havg at least two vertces of the same degree ad T = V\ S. The degree splttg graph of G deoted by DS(G) s obtaed from G by addg vertces w,w,w,, w t ad jog to each vertex of S for t. Defto :. For a smple coected graph G the square of graph G s deoted by G ad defed as the graph wth the same vertex set as of G ad two vertces are adjacet G f they are at a dstace or apart G. Defto :.0 Bstar B s the graph obtaed by jog the ceter (apex) vertces of two copes of by a edge. Defto :. A subdvso of the edge e = uv of a graph G s the replacemet of the edge e by a ew vertex w ad two ew edges uw ad wv. Ths operato s also called a elemetary subdvso of G. A graph H obtaed by a sequece of elemetary subdvsos from a graph G s sad to be a subdvso graph of G. It s deoted by S(G). Defto :. A vertex swtchg G v of a graph G s obtaed by takg a vertex v of G, removg the etre edges cdet wth v ad addg edges jog v to every vertex whch are ot adjacet to v G. Defto :. Cosder t copes of stars amely,,..., The G = <, (), (),..., jog apex vertces of each () () (t). (t) > s the graph obtaed by (m ) ad (m) to a ew. Ma Results Theorem. The wheel graph W = C + s vertex odd dvsor cordal graph, where. Let G be a wheel graph W = C +. Let v be the cetral vertex ad v,... be the vertces of C. The V(G ) = + ad E(G) =. Defe vertex labelg f : V(G) {,,,,+} as f(v) =, Case : (mod ) f(v ) = +,. f(v ) = +, f(v ) =. The e f () = e f (0) =. Case : 0, (mod ) f(v ) = +,. The e f () = e f (0) =. I both the cases, we have e f (0) e f (). Therefore, W s vertex odd dvsor cordal graph. Example. The vertex odd dvsor cordal labelg of W 4 s show fgure.. Theorem. Fgure. Swtchg of a vertex cycle C admts vertex odd dvsor cordal labelg. Let v, be the successve vertces of C. G v deotes graph s obtaed by swtchg of vertex v of G = C. Wthout loss of geeralty let the swtched vertex be v. The V( G ) = ad E( G ) =. v v 6
3 IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. Defe vertex labelg f : V( G v ) {,,,, } as f(v ) =, f(v ) = for The, e f () = ad e f (0) =. Thus, e f (0) e f (). Hece, the graph obtaed by swtchg of a vertex cycle C s a vertex odd dvsor cordal graph. Example. The vertex odd dvsor cordal labelg of swtchg of a vertex cycle C 8 s show fgure.. Theorem. Fgure. Swtchg of a pedet vertex path P s vertex odd dvsor cordal graph. Let v,, be the vertces of path P. The graph G s obtaed by swtchg of a pedet vertex path P. v ad v are pedet vertex of path P. Wthout loss of geeralty, let the swtched vertex be v. The V(G ) = ad E(G) = 4. Defe vertex labelg f : V(G) {,,,, } as f(v ) =,. The e f (0) = e f () =. Therefore, e f (0) e f (). Hece, G s vertex odd dvsor cordal graph. Example. The vertex odd dvsor cordal labelg of swtchg of a pedet vertex path P 6 s show fgure.. Theorem.4 Fgure. ISSN The Bstar B s vertex odd dvsor cordal graph, where. Let B be a graph wth vertex set {u,v,u,v, }, where u are pedat vertces. Let G be the graph B. The vertex set V(G) = {u, w, u : } ad the edge set E(G) = {uw, uu v, : }. The V(G) = + ad E(G) = +. p s the largest prme umber such that p 4+. Defe vertex labelg f : V(G) {,,...,4+} as f(u) =, f(v) = p ad assg the remag labels to the remag vertces v,v,,v,u,u,,u. The e f (0) = ad e f () = +. Therefore, e f (0) e f (). Hece G s vertex odd dvsor cordal graph. Example.4 The vertex odd dvsor cordal labelg of B 4,4 s show fgure.4. Theorem. Fgure.4 The graph S( ) s a vertex odd dvsor cordal graph. Proof Let G be a subdvso of the star. Let V(G) = {v, u : } ad E(G) = {vv,v u : }. The G = S( ). Defe vertex labelg f : V(G) {,,,,4+} as follows f(v) =, f(v ) = + 4( ) for, f(u ) = + 4( ) for.
4 IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. The, e f (0) = e f () =. Therefore e f (0) e f (). Hece S( ) s a vertex odd dvsor cordal graph. Example. The vertex odd dvsor cordal labelg of S(, ) s show fgure.. Fgure. Theorem.6 B s a vertex odd dvsor cordal graph. Let B be a graph wth vertex set {u,v,u,v, }, where u are pedat vertces. Let G be the graph B The V(G) = + ad E(G) = 4+. Let p be the largest prme umber p 4+. Defe vertex labelg f : V(G) {,,,, 4+} as f(u) =, f(v) = p, Assg the remag labels to the remag vertces u, u,, u,. The, e f (0) =, e f () = +. Thus, e f (0) e f (). Hece, B s a vertex odd dvsor cordal graph. Example.6 Theorem. Fgure.6 ISSN S (B ) s a vertex odd dvsor cordal graph. Let B be a graph wth vertex set {u,v,u,v, }, where u are pedat vertces. I order to obta S (B ), add u, u vertces correspodg to u, u, where. Let G be a graph S (B ). The V(G) = 4(+) ad E(G) = 6 +. Let p ad p be the largest ad ext largest prme umbers, such that p < p 8+. Defe vertex labelg f :V(G) {,,,, 8+} as f(u) =, f(u ) =, f(v) = p, f(v ) = p, f(u ) = + 6( ) for f( u ) = f(u ) for ) = f(u ) 4 for Assg the remag labels to the remag vertces v,. The, e f (0) = + ad e f () = +. Thus, e f (0) e f (). Hece, S (B ) s a vertex odd dvsor cordal graph. Example. The vertex odd dvsor cordal labelg of S (B, ) s show fgure.. The vertex odd dvsor cordal labelg of B, show fgure.6. s Fgure. 8
5 IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. Theorem.8 Theorem. ISSN DS(B ) s a vertex odd dvsor cordal graph. Let B be a graph wth vertex set {u,v,u,v, }, where u are pedat vertces. Here, V(B ) = V V, where V = {u : } ad V = {u}. I order to obta DS(B ) from B, add w, w correspodg to V ad V. Let G be a graph DS(B ). The, V(G) = +4 ad E(G) = 4+. Let p be the largest prme umber such that p 8+. Defe vertex labelg f : V(G) {,,,, 8+} as f(u) =, f(v) = p, f(w ) =, f(w ) =, Case : s eve ad k = / f(u ) = + 6( ) for k f(u ) = + 6( k ) for k+. The, e f (0) = + ad e f () = +. Case : s odd ad k = (+)/ f(u ) = + 6( ) for k f(u ) = + 6( k ) for k+. The, e f (0) = + ad e f () = +. I both cases, e f (0) e f (). Hece, DS(B ) s a vertex odd dvsor cordal graph. Example.8 The vertex odd dvsor cordal labelg of DS(B, ) s show fgure.8. Fgure.8 The graph G = < () () (),,, > s vertex odd dvsor cordal. Let G = < () () (),,, > be a graph wth + vertces ad + 4 edges. () () () Let v,... be the pedat vertces of (), () ad let c be the apex vertex of for =,,. The V(G) = + ad E(G) = +4. Here, c ad c are adjacet to x ad c ad c are adjacet to x. Let p be the largest prme umber such that p 6+. Defe vertex labelg f : V(G) {,,,, 6+ } as f(c ) = p, f(c ) =, f(c ) =, f(x ) =, f(x ) =, Case : s eve ad k = / () ) = + 6( ) for k () ) = + 6( k ) for k+. Assg the remag labels to the remag vertces () () () () () () v,..., The, e f (0) = e f () =. Case : s odd ad k = (+)/ () ) = + 6( ) for k () ) = + 6( k ) for k+. Assg the remag labels to the remag vertces () () () () () () v,..., The, e f (0) = ad e f () =. I both cases, e f (0) e f (). Hece, the graph G = < () () (),,, > s vertex odd dvsor cordal graph. Example. The vertex odd dvsor cordal labelg of the graph, > s show fgure.. < (),, (), (),
6 4. Coclusos IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. Fgure. I ths paper, the vertex odd dvsor cordal labelg of wheel graph W, swtchg of a pedet vertex path P, swtchg of a vertex cycle C, Bstar B, S( ), B, DS(B ), S (B ) ad < proved. (), (), () > are ISSN Appled Mathematcs, Vol 4, No., 0, pp. 0-. [] R. Varatharaja, S. Navaaeethakrsha ad. Nagaraja, Dvsor cordal graphs, Iteratoal J. Math. Comb., Vol 4, 0, pp. -. [] R. Varatharaja, S. Navaaeethakrsha ad. Nagaraja, Specal classes of dvsor cordal graphs, Iteratoal Mathematcal Forum, Vol, No., 0, pp. -4. Refereces [] I. Caht, Cordal graphs: A weaker verso of graceful ad harmoous graphs, Ars Combatora, Vol, 8, pp [] Davd M. Burto, Elemetary Number Theory, Secod Edto, Wm. C. Brow Compay Publshers, 80. [] J. A. Galla, A dyamc survey of graph labelg, The Electroc Joural of Combatorcs, 6, # DS6, 0. [4] F. Harary, Graph Theory, Addso-Wesley, Readg, Mass,. [] P. Lawrece Rozaro Raj ad R. Vall, Some ew famles of dvsor cordal graphs, Iteratoal Joural of Mathematcs Treds ad Techology, Vol, No., 04. [6] P. Lawrece Rozaro Raj ad R. Lawrece Joseph Maohara, Dvsor Cordal Labellg of Some Dscoected Graphs, Iteratoal Joural of Mathematcs Treds ad Techology, Vol., No., 04, pp 4-6. [] P.Maya ad T.Ncholas, Some New Famles of Dvsor Cordal Graph, Aals of Pure ad Appled Mathematcs Vol., No., 04, pp. -4. [8] A. Muthaya ad P. Pugaleth, Some ew dvsor cordal graphs, Iteratoal Joural of Mathematcs Treds ad Techology, Vol, No., 04. [] A. Muthaya ad P. Pugaleth, Vertex odd dvsor cordal graphs, commucated. [0] S.. Vadya ad N. H. Shah, Some Star ad Bstar Related Dvsor Cordal Graphs, Aals of Pure ad Appled Mathematcs, Vol, No., 0, pp. 6-. [] S.. Vadya ad N. H. Shah, Further Results o Dvsor Cordal Labelg, Aals of Pure ad 400
EDGE- ODD Gracefulness of the Tripartite Graph
EDGE- ODD Graceuless o the Trpartte Graph C. Vmala, A. Saskala, K. Ruba 3, Asso. Pro, Departmet o Mathematcs, Peryar Maamma Uversty, Vallam, Thajavur Post.. Taml Nadu, Ida. 3 M. Phl Scholar, Departmet
More informationAT MOST EDGE 3 - SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD
Iteratoal Joural o Research Egeerg ad Appled Sceces IJREAS) Avalable ole at http://euroasapub.org/ourals.php Vol. x Issue x, July 6, pp. 86~96 ISSNO): 49-395, ISSNP) : 349-655 Impact Factor: 6.573 Thomso
More informationSome Results on Vertex Equitable Labeling
Ope Joural of Dscrete Mathematcs, 0,, 5-57 http://dxdoorg/0436/odm0009 Publshed Ole Aprl 0 (http://wwwscrporg/oural/odm) Some Results o Vertex Equtable Labelg P Jeyath, A Maheswar Research Cetre, Departmet
More informationVERTEX ODD DIVISOR CORDIAL GRAPHS
Asia Pacific Journal of Research Vol: I. Issue XXXII, October 20 VERTEX ODD DIVISOR CORDIAL GRAPHS A. Muthaiyan and 2 P. Pugalenthi Assistant Professor, P.G. and Research Department of Mathematics, Govt.
More informationInternational Mathematical Forum, 1, 2006, no. 31, ON JONES POLYNOMIALS OF GRAPHS OF TORUS KNOTS K (2, q ) Tamer UGUR, Abdullah KOPUZLU
Iteratoal Mathematcal Forum,, 6, o., 57-54 ON JONES POLYNOMIALS OF RAPHS OF TORUS KNOTS K (, q ) Tamer UUR, Abdullah KOPUZLU Atatürk Uverst Scece Facult Dept. of. Math. 54 Erzurum, Turkey tugur@atau.edu.tr
More informationKeywords: complete graph, coloursignlesslaplacian matrix, coloursignlesslaplacian energy of a graph.
Amerca Iteratoal Joural of Research Scece, Techology, Egeerg & Mathematcs Avalable ole at http://www.asr.et ISSN (Prt): 38-3491, ISSN (Ole): 38-3580, ISSN (CD-ROM): 38-369 AIJRSTEM s a refereed, dexed,
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationNEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS
NEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS A. Muthaiyan # and G. Bhuvaneswari * Department of Mathematics, Government Arts and Science College, Veppanthattai, Perambalur - 66, Tamil Nadu, India. P.G.
More informationFor all questions, answer choice E) NOTA" means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA
For all questos, aswer choce " meas oe of the above aswers s correct.. What s the sum of the frst 000 postve tegers? A) 50,500 B) 500,000 C) 500,500 D),00,000. What s the sum of the tegers betwee 00 ad
More informationCubic fuzzy H-ideals in BF-Algebras
OSR Joural of Mathematcs (OSR-JM) e-ssn: 78-578 p-ssn: 39-765X Volume ssue 5 Ver (Sep - Oct06) PP 9-96 wwwosrjouralsorg Cubc fuzzy H-deals F-lgebras Satyaarayaa Esraa Mohammed Waas ad U du Madhav 3 Departmet
More informationDivisor Cordial Labeling in the Context of Graph Operations on Bistar
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 3 (2016), pp. 2605 2618 Research India Publications http://www.ripublication.com/gjpam.htm Divisor Cordial Labeling in the
More informationOn a Sufficient and Necessary Condition for Graph Coloring
Ope Joural of Dscrete Matheatcs, 04, 4, -5 Publshed Ole Jauary 04 (http://wwwscrporg/joural/ojd) http://dxdoorg/0436/ojd04400 O a Suffcet ad Necessary Codto for raph Colorg Maodog Ye Departet of Matheatcs,
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar
Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng
More informationEight Solved and Eight Open Problems in Elementary Geometry
Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary
More information4-PRIME CORDIAL LABELING OF SOME DEGREE SPLITTING GRAPHS
Iteratioal Joural of Maagemet, IT & Egieerig Vol. 8 Issue 7, July 018, ISSN: 49-0558 Impact Factor: 7.119 Joural Homepage: Double-Blid Peer Reviewed Refereed Ope Access Iteratioal Joural - Icluded i the
More informationOffice Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30.
Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. COS 31 Dscrete Math 1 Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. Nobody seems to care. Chage oce hours? Tuesday, 8 PM
More informationNine Solved and Nine Open Problems in Elementary Geometry
Ne Solved ad Ne Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew e prevous proposed ad solved problems of elemetary D geometry
More informationA PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS
ISSN: 39-8753 Iteratoal Joural of Iovatve Research Scece, Egeerg ad Techology A ISO 397: 7 Certfed Orgazato) Vol. 3, Issue, Jauary 4 A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS
More informationDivisor cordial labeling in context of ring sum of graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (2017), 23-31. ISSN Print : 2249-3328 ISSN Online : 2319-5215 Divisor cordial labeling in context of ring sum of graphs G. V. Ghodasara
More informationEight Solved and Eight Open Problems in Elementary Geometry
Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary
More informationEVEN SUM CORDIAL LABELING FOR SOME NEW GRAPHS
International Journal of Mechanical ngineering and Technology (IJMT) Volume 9, Issue 2, February 2018, pp. 214 220 Article ID: IJMT_09_02_021 Available online at http://www.iaeme.com/ijmt/issues.asp?jtype=ijmt&vtype=9&itype=2
More informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationVertex Odd Divisor Cordial Labeling for Vertex Switching of Special Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 555 5538 Research India Publications http://www.ripublication.com/gjpam.htm Vertex Odd Divisor Cordial Labeling
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationEVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS
Kragujevac Joural of Matheatics Volue 43(3) (019), Pages 47 441. EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS A. LOURDUSAMY 1 AND F. PATRICK 1 Abstract. Let G be a graph with p vertices
More informationAMO - Advanced Modeling and Optimization, Volume 16, Number 2, 2014 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS
AMO - Advanced Modeling and Optimization, Volume 6, Number, 4 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS S K Vaidya Department of Mathematics, Saurashtra University, Rajkot-6 5, GUJARAT (INDIA).
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationEdge-Odd Graceful Labeling for Sum of a Path and a Finite Path
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 323-335 International Research Publication House http://www.irphouse.com Edge-Odd Graceful Labeling
More informationOn Characteristic Polynomial of Directed Divisor Graphs
Iter. J. Fuzzy Mathematical Archive Vol. 4, No., 04, 47-5 ISSN: 30 34 (P), 30 350 (olie) Published o April 04 www.researchmathsci.org Iteratioal Joural of V. Maimozhi a ad V. Kaladevi b a Departmet of
More informationGLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES GROUP S 3 CORDIAL PRIME LABELING OF WHEEL RELATED GRAPH B. Chandra *1 & R.
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES GROUP S 3 CORDIAL PRIME LABELING OF WHEEL RELATED GRAPH B. Chandra *1 & R. Kala 2 *1 Reg. No. 7348, Research Scholar, Department of Mathematics, Manonmaniam
More informationBezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon
Curve represetato Copyrght@, YZU Optmal Desg Laboratory. All rghts reserved. Last updated: Yeh-Lag Hsu (--). Note: Ths s the course materal for ME55 Geometrc modelg ad computer graphcs, Yua Ze Uversty.
More informationOn Embedding and NP-Complete Problems of Equitable Labelings
IOSR Journal o Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 39-765X Volume, Issue Ver III (Jan - Feb 5), PP 8-85 wwwosrjournalsorg Ombeddng and NP-Complete Problems o Equtable Labelngs S K Vadya, C M Barasara
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More information4-Prime cordiality of some cycle related graphs
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 1, Issue 1 (Jue 017), pp. 30 40 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) 4-Prime cordiality of some cycle related
More informationM. Ibrahim Moussa. Faculty of Computers & Information, Benha University, Benha, Egypt.
ABSTRACT M. Ibrah Mossa Faclty of Copters & Iforato, Beha Uversty, Beha, Egypt ossa_6060@yahoo.co I 1991, Gaajoth [] proved that the path graph P wth vertex ad 1edge s odd gracefl, ad the cycle graph C
More informationSome Results On Vertex Odd Divisor Cordial Labeling of Graphs
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 11 2017, 199 207 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Some Results
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationOdd Graceful Labeling of Some New Type of Graphs
Internatonal Journal o Mathematcs Trends and Technology IJMTT) Volume 41 Number 1- January 2017 Odd Graceul Labelng o Some New Type o Graphs Sushant Kumar Rout 1 Debdas Mshra 2 and Purna chandra Nayak
More informationCycle Related Subset Cordial Graphs
International Journal of Applied Graph Theory Vol., No. (27), 6-33. ISSN(Online) : 2456 7884 Cycle Related Subset Cordial Graphs D. K. Nathan and K. Nagarajan PG and Research Department of Mathematics
More informationCOMSC 2613 Summer 2000
Programmg II Fal Exam COMSC 63 Summer Istructos: Name:. Prt your ame the space provded Studet Id:. Prt your studet detfer the space Secto: provded. Date: 3. Prt the secto umber of the secto whch you are
More informationPrime Harmonious Labeling of Some New Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 5 Ver. IV (Sep. - Oct.2016), PP 57-61 www.iosrjournals.org Prime Harmonious Labeling of Some New Graphs P.Deepa
More informationL (d, 2, 1) Labeling of Helm graph
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 7, Number 1 (2015), pp. 45-52 International Research Publication House http://www.irphouse.com L (d, 2, 1) Labeling
More informationOn Balance Index Set of Double graphs and Derived graphs
International Journal of Mathematics and Soft Computing Vol.4, No. (014), 81-93. ISSN Print : 49-338 ISSN Online: 319-515 On Balance Index Set of Double graphs and Derived graphs Pradeep G. Bhat, Devadas
More informationCOMBINATORIAL METHOD OF POLYNOMIAL EXPANSION OF SYMMETRIC BOOLEAN FUNCTIONS
COMBINATORIAL MTHOD O POLYNOMIAL XPANSION O SYMMTRIC BOOLAN UNCTIONS Dala A. Gorodecky The Uted Isttute of Iformatcs Prolems of Natoal Academy of Sceces of Belarus, Msk,, Belarus, dala.gorodecky@gmal.com.
More informationNeighbourhood Prime Labeling On Some Graphs
Neighbourhood Prime Labeling On Some Graphs R. Senthil Amutha 1, N. Murugesan 2 Department of Mathematics, Sree Saraswathi Thyagaraja College, Pollachi, India 1 Department of Mathematics, Government Arts
More informationGracefulness of a New Class from Copies of kc 4 P 2n and P 2 * nc 3
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 75-81 Research India Publications http://www.ripublication.com Gracefulness of a New Class from Copies
More informationAnalysis of Some Bistar Related MMD Graphs
Volume 118 No. 10 2018, 407-413 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v118i10.41 ijpam.eu Analysis of Some Bistar Related MMD
More informationSquare Difference Prime Labeling for Some Snake Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (017), pp. 1083-1089 Research India Publications http://www.ripublication.com Square Difference Prime Labeling for Some
More informationGraceful V * 2F n -tree
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 10, Issue 2 Ver. IV (Mar-Apr. 2014), PP 01-06 Graceful V * 2F n -tree D. R. Kirubaharan 1, Dr. G. Nirmala 2 1 Research
More informationRadio coloring for families of Bistar graphs
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 11 2017, 75 83 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Radio coloring
More informationSOME RESULTS ON EVEN VERTEX ODD MEAN LABELING GRAPHS
International Journal of Mechanical Engineering and Technology (IJMET) Volume 9, Issue 2, February 2018, pp. 615 621 Article ID: IJMET_09_02_062 Available online at http://www.iaeme.com/ijmet/issues.asp?jtype=ijmet&vtype=9&itype=2
More informationConstructive Semi-Supervised Classification Algorithm and Its Implement in Data Mining
Costructve Sem-Supervsed Classfcato Algorthm ad Its Implemet Data Mg Arvd Sgh Chadel, Arua Twar, ad Naredra S. Chaudhar Departmet of Computer Egg. Shr GS Ist of Tech.& Sc. SGSITS, 3, Par Road, Idore (M.P.)
More informationArea and Power Efficient Modulo 2^n+1 Multiplier
Iteratoal Joural of Moder Egeerg Research (IJMER) www.jmer.com Vol.3, Issue.3, May-Jue. 013 pp-137-1376 ISSN: 49-6645 Area ad Power Effcet Modulo ^+1 Multpler K. Ptambar Patra, 1 Saket Shrvastava, Sehlata
More informationGraceful Labeling for Cycle of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 6, Number (014), pp. 173 178 International Research Publication House http://www.irphouse.com Graceful Labeling for Cycle of Graphs
More informationBiconnected Components
Presetato for use wth the textbook, Algorthm Desg ad Applcatos, by M. T. Goodrch ad R. Tamassa, Wley, 2015 Bcoected Compoets SEA PVD ORD FCO SNA MIA 2015 Goodrch ad Tamassa Bcoectvty 1 Applcato: Networkg
More informationLP: example of formulations
LP: eample of formulatos Three classcal decso problems OR: Trasportato problem Product-m problem Producto plag problem Operatos Research Massmo Paolucc DIBRIS Uversty of Geova Trasportato problem The decso
More informationPrime and Prime Cordial Labeling for Some Special Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2, no. 47, 2347-2356 Prime and Prime Cordial Labeling for Some Special Graphs J. Baskar Babujee and L. Shobana Department of Mathematics Anna University Chennai,
More informationHypo-k-Totally Magic Cordial Labeling of Graphs
Proyecciones Journal of Mathematics Vol. 34, N o 4, pp. 351-359, December 015. Universidad Católica del Norte Antofagasta - Chile Hypo-k-Totally Magic Cordial Labeling of Graphs P. Jeyanthi Govindammal
More informationGraceful Labeling for Some Star Related Graphs
International Mathematical Forum, Vol. 9, 2014, no. 26, 1289-1293 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.4477 Graceful Labeling for Some Star Related Graphs V. J. Kaneria, M.
More informationSuper Vertex Magic and E-Super Vertex Magic. Total Labelling
Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a
More informationOptimal Allocation of Complex Equipment System Maintainability
Optmal Allocato of Complex Equpmet System ataablty X Re Graduate School, Natoal Defese Uversty, Bejg, 100091, Cha edcal Protecto Laboratory, Naval edcal Research Isttute, Shagha, 200433, Cha Emal:rexs841013@163.com
More informationProduct Cordial Labeling for Some New Graphs
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 3, No. ; May 011 Product Cordial Labeling for Some New Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University
More informationGraceful and odd graceful labeling of graphs
International Journal of Mathematics and Soft Computing Vol.6, No.2. (2016), 13-19. ISSN Print : 2249 3328 ISSN Online: 2319 5215 Graceful and odd graceful labeling of graphs Department of Mathematics
More informationInternational Journal of Mathematical Archive-6(8), 2015, Available online through ISSN
International Journal of Mathematical Archive-6(8), 2015, 66-80 Available online through www.ijma.info ISSN 2229 5046 SUBDIVISION OF SUPER GEOMETRIC MEAN LABELING FOR TRIANGULAR SNAKE GRAPHS 1 S. S. SANDHYA,
More informationProbabilistic properties of topologies of finite metric spaces minimal fillings.
arxv:308.656v [math.mg] Aug 03 Probablstc propertes of topologes of fte metrc spaces mmal fllgs. Vsevolod Salkov Abstract I ths work we provde a way to troduce a probablty measure o the space of mmal fllgs
More informationSome New Results on Prime Graphs
Ope Joural of Discrete Mathematics, 202, 2, 99-04 http://dxdoiorg/0426/ojdm202209 Published Olie July 202 (http://wwwscirporg/joural/ojdm) Some New Results o Prime Graphs Samir Vaidya, Udaya M Prajapati
More informationSuper Geometric Mean Labeling Of Some Disconnected Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 7, Number 2 (2015), pp. 97-108 International Research Publication House http://www.irphouse.com Super Geometric Mean Labeling Of Some
More informationA New Approach for Reconstructed B-spline Surface Approximating to Scattered Data Points. Xian-guo CHENG
2016 Iteratoal Coferece o Computer, Mechatrocs ad Electroc Egeerg (CMEE 2016 ISBN: 978-1-60595-406-6 A New Approach for Recostructed B-sple Surface Approxmatg to Scattered Data Pots Xa-guo CHENG Ngbo Uversty
More informationEdge-Odd Graceful Labeling of Sum of K 2 & Null Graph with n Vertices and a Path of n Vertices Merging with n Copies of a Fan with 6 Vertices
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (2017), pp. 4943-4952 Research India Publications http://www.ripublication.com Edge-Odd Graceful Labeling of Sum of K
More informationSome Graph Operations Of Even Vertex Odd Mean Labeling Graphs
Some Graph Operations Of Even Vertex Odd Mean Labeling Graphs M.Kannan, R.Virama Prasad and R.Gopi 3 Research Scholar,Research & Development Centre, Bharathiar University, Coimbatore 64 046, India. Department
More informationEdge Graceful Labeling of Some Trees
Global Journal of Mathematical Sciences: Theory and Practical. olume, Number (0), pp. - International Research Publication House http://www.irphouse.com Edge Graceful Labeling of Some Trees B. Gayathri
More informationVariation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs
Annals of Pure and Applied Mathematics Vol. 8, No., 014, 19-5 ISSN: 79-087X (P), 79-0888(online) Published on 17 December 014 www.researchmathsci.org Annals of Variation of Graceful Labeling on Disjoint
More informationPrime Labeling for Some Planter Related Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 8, Number 3 (2016), pp. 221-231 International Research Publication House http://www.irphouse.com Prime Labeling for Some Planter Related
More informationCouncil for Innovative Research Peer Review Research Publishing System Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
ABSTRACT Odd Graceful Labeling Of Tensor Product Of Some Graphs Usha Sharma, Rinku Chaudhary Depatment Of Mathematics and Statistics Banasthali University, Banasthali, Rajasthan-304022, India rinkuchaudhary85@gmail.com
More informationRadio Number for Special Family of Graphs with Diameter 2, 3 and 4
MATEMATIKA, 2015, Volume 31, Number 2, 121 126 c UTM Centre for Industrial and Applied Mathematics Radio Number for Special Family of Graphs with Diameter 2, 3 and 4 Murugan Muthali School of Science,
More informationRemainder Cordial Labeling of Graphs
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir Remainder Cordial Labeling of Graphs R. Ponraj 1, K. Annathurai and R. Kala 3 1 Department of Mathematics, Sri Paramakalyani
More informationCordial Double-Staircase Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 3395-3401 Research India Publications http://www.ripublication.com Cordial Double-Staircase Graphs K. Ameenal
More informationChEn 475 Statistical Analysis of Regression Lesson 1. The Need for Statistical Analysis of Regression
Statstcal-Regresso_hadout.xmcd Statstcal Aalss of Regresso ChE 475 Statstcal Aalss of Regresso Lesso. The Need for Statstcal Aalss of Regresso What do ou do wth dvdual expermetal data pots? How are the
More informationChapter 5. E-cordial Labeling of Graphs
Chapter 5 E-cordial Labeling of Graphs 65 Chapter 5. E-cordial Labeling of Graphs 66 5. Introduction In 987 the concept of cordial labeling was introduced by Cahit [6] as a weaker version of graceful and
More informationHeronian Mean Labeling of Graphs
International Mathematical Forum, Vol. 12, 2017, no. 15, 705-713 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.68108 Heronian Mean Labeling of Graphs S.S. Sandhya Department of Mathematics
More informationSome Star Related Vertex Odd Divisor Cordial Labeling of Graphs
Annals o Pure and Applied Mathematics Vol. 6, No., 08, 385-39 ISSN: 79-087X (P), 79-0888(online) Published on 6 February 08 www.researchmathsci.org DOI: http://dx.doi.org/0.457/apam.v6na5 Annals o Some
More informationSeema Mehra, Neelam Kumari Department of Mathematics Maharishi Dayanand University Rohtak (Haryana), India
International Journal of Scientific & Engineering Research, Volume 5, Issue 10, October-014 119 ISSN 9-5518 Some New Families of Total Vertex Product Cordial Labeling Of Graphs Seema Mehra, Neelam Kumari
More informationMean, Odd Sequential and Triangular Sum Graphs
Circulation in Computer Science Vol.2, No.4, pp: (40-52), May 2017 https://doi.org/10.22632/ccs-2017-252-08 Mean, Odd Sequential and Triangular Sum Graphs M. A. Seoud Department of Mathematics, Faculty
More informationTotal magic cordial labeling and square sum total magic cordial labeling in extended duplicate graph of triangular snake
2016; 2(4): 238-242 ISSN Print: 2394-7500 ISSN Online: 2394-5869 Impact Factor: 5.2 IJAR 2016; 2(4): 238-242 www.allresearchjournal.com Received: 28-02-2016 Accepted: 29-03-2016 B Selvam K Thirusangu P
More informationAn Enhanced Local Covering Approach for Minimization of Multiple-Valued Input Binary-Valued Output Functions
Proceedgs of the 10th WSEAS Iteratoal Coferece o COMPUTERS, Voulagme, Athes, Greece, July 13-15, 2006 (pp63-68) A Ehaced Local Coverg Approach for Mmzato of Multple-Valued Iput Bary-Valued Output Fuctos
More informationSuper vertex Gracefulness of Some Special Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 07-15 www.iosrjournals.org Super vertex Gracefulness of Some Special Graphs N.Murugesan
More informationMachine Learning: Algorithms and Applications
/03/ Mache Learg: Algorthms ad Applcatos Florao Z Free Uversty of Boze-Bolzao Faculty of Computer Scece Academc Year 0-0 Lecture 3: th March 0 Naïve Bayes classfer ( Problem defto A trag set X, where each
More informationChapter 3 Descriptive Statistics Numerical Summaries
Secto 3.1 Chapter 3 Descrptve Statstcs umercal Summares Measures of Cetral Tedecy 1. Mea (Also called the Arthmetc Mea) The mea of a data set s the sum of the observatos dvded by the umber of observatos.
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationSunoj B S *, Mathew Varkey T K Department of Mathematics, Government Polytechnic College, Attingal, Kerala, India
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 1 ISSN : 256-3307 Mean Sum Square Prime Labeling of Some Snake Graphs
More information4 Remainder Cordial Labeling of Some Graphs
International J.Math. Combin. Vol.(08), 8-5 Remainder Cordial Labeling of Some Graphs R.Ponraj, K.Annathurai and R.Kala. Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-67, India. Department
More informationProduct Cordial Labeling of Some Cycle Related Graphs
Product Cordial Labeling of Some Cycle Related Graphs A. H. Rokad 1, G. V. Ghodasara 2 1 PhD Scholar, School of Science, RK University, Rajkot - 360020, Gujarat, India 2 H. & H. B. Kotak Institute of Science,
More informationPAijpam.eu PRIME CORDIAL LABELING OF THE GRAPHS RELATED TO CYCLE WITH ONE CHORD, TWIN CHORDS AND TRIANGLE G.V. Ghodasara 1, J.P.
International Journal of Pure and Applied Mathematics Volume 89 No. 1 2013, 79-87 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v89i1.9
More informationNEURO FUZZY MODELING OF CONTROL SYSTEMS
NEURO FUZZY MODELING OF CONTROL SYSTEMS Efré Gorrosteta, Carlos Pedraza Cetro de Igeería y Desarrollo Idustral CIDESI, Av Pe de La Cuesta 70. Des. Sa Pablo. Querétaro, Qro, Méxco gorrosteta@teso.mx pedraza@cdes.mx
More informationVertex Graceful Labeling of C j C k C l
Applied Mathematical Sciences, Vol. 8, 01, no. 8, 07-05 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.01.5331 Vertex Graceful Labeling of C j C k C l P. Selvaraju 1, P. Balaganesan,5, J. Renuka
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationTransistor/Gate Sizing Optimization
Trasstor/Gate Szg Optmzato Gve: Logc etwork wth or wthout cell lbrary Fd: Optmal sze for each trasstor/gate to mmze area or power, both uder delay costrat Statc szg: based o tmg aalyss ad cosder all paths
More information