Lucky Edge Labeling of P n, C n and Corona of P n, C n
|
|
- Sherilyn Jones
- 5 years ago
- Views:
Transcription
1 International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume, Issue 8, August 0, PP ISSN 7-07X (Print) & ISSN 7- (Online) Lucky Edge Labeling of P n, C n and Corona of P n, C n Dr. A. Nellai Murugan Department of Mathematics, V.O.Chidambaram College, Tuticorin, Tamilnadu(INDIA) anellai.vocc@gmail.com R. Maria Irudhaya Aspin Chitra Department of Mathematics, V.O.Chidambaram College, Tuticorin, Tamilnadu(INDIA) aspinvjs@gmail.com Abstract: Let G be a Simple Graph with Vertex set V(G) and Edge set E(G) respectively. Vertex set V(G) is labeled arbitrary by positive integers and let E(e) denote the edge label such that it is the sum of labels of vertices incident with edge e. The labeling is said to be lucky edge labeling if the edge set E(G) is a proper coloring of G, that is, if we have E(e ) E(e ) whenever e and e are adjacent edges. The least integer k for which a graph G has a lucky edge labeling from the set {,,.,k} is the lucky number of G denoted by η(g). A graph which admits lucky edge labeling is the lucky edge labeled graph.in this paper, it is proved that Path P n, Comb P n +, Cycle C n, Crown C n + are lucky edge labeled graphs. Keywords: Lucky Edge Labeled Graph, Lucky Edge Labeling, Lucky Number, 00 Mathematics subject classification Number: 0C78.. INTRODUCTION A graph G is a finite non empty set of objects called vertices together with a set of pairs of distinct vertices of G which is called edges. Each e={uv} of vertices in E is called an edge or a line of G. For Graph Theoretical Terminology, [].. PRELIMINARIES Definition:. Let G be a Simple Graph with Vertex set V(G) and Edge set E(G) respectively. Vertex set V(G) are labeled arbitrary by positive integers and let E(e) denote the edge label such that it is the sum of labels of vertices incident with edge e. The labeling is said to be lucky edge labeling if the edge set E(G) is a proper coloring of G,that is, if we have E(e ) E(e ) whenever e and e are adjacent edges. The least integer k for which a graph G has a lucky edge labeling from the set {,,.,k} is the lucky number of G denoted by η(g). A graph which admits lucky edge labeling is the lucky edge labeled graph. Definition:. A Walk of a graph G is an alternating sequence of vertices and edges v, e, v, e,..v n-, e n, v n beginning and ending with vertices such that each edge e i is incident with v i- and v i. Definition:. If all the vertices in a walk are distinct, then it is called a Path and a path of length n is denoted by P n+. Definition:. A graph obtained by joining each u i to a vertex v i is called a Comb and denoted by P n +. The Vetex set and Edge set of P n + is V[P n + ] = {u i,v i : i n} and E[P n + ] = {(u i u i+ ): i n-} {(u i v i ): i n} respectively. P n + has n vertices and n- edges. Definition:. A closed path is called a Cycle and a cycle of length n is denoted by C n. ARC Page 70
2 Dr. A. Nellai Murugan & R. Maria Irudhaya Aspin Chitra Definition:.6 C n + is a graph obtained from G by attaching a pendent vertex from each vertex of the graph Cn is called Crown.. MAIN RESULTS Theorem:. P n has {a, b} lucky edge labeling graph for any a, b. Proof: Let V[P n ] = { u i : i n }and E[P n ] = { (u i u i+ ): i n- }. Let f: V[P n ] {, } defined by f(u i ) = and i, for n is odd and i, for n is even. f(u i- ) = and i, for n is odd and i, for n is even. whenn is odd, i and when n is even, i ( f * (u i u i+ ) = whenn is odd, i f * (u i- u i ) = and when n is even, i It is clear that lucky edge labeling of P n is {,, }. Hence,P n has lucky edge labeling graph. For example, lucky edge labeling of P 6 is shown in figure and η(p n ) =. Theorem:. Figure and η(p n ) = P n + has {a, b, c} lucky edge labeling graph for any a, b, c. Proof: u u u u u u 6 Let V[P n + ] = {{u i : i n}, {v i : i n}}and E[P n + ] = {(u i u i+ ): i n-} {(u i v i ): i n}. Let f: V[P n + ] {,, } defined by f(u i ) = and i, for n is odd and i, for n is even. f(u i- ) = and i, for n is odd and i, for n is even. International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 7 u
3 Lucky Edge Labeling of P n, C n and Corona of P n, C n f(v ) = f(v i ) =, i n- f(v n ) =. whenn is odd, i and when n is even, i ( f * (u i u i+ ) = whenn is odd, i and when n is even, i f * (u i- u i ) = f * (u v ) = f * (u i v i ) = for i n-. f * (u n v n ) =. It is clear that lucky edge labeling of P + n is {,,, }. + Hence,P n hasluky edge labeling graph. For example, lucky edge labeling of P + and P + 6 are given in the figure a and figure b and η(p + n ) =. u u u u u v v v v v u u Figure a and η(p n + ) = u u u u 6 v Figure b and η(p + n ) = Theorem.: C n : n,, (mod ) has {a, b, c} lucky edge labeling and C n : n 0 (mod ) has {a, b} lucky edge labeling for any a, b, c. v v v v v 6 International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 7
4 Dr. A. Nellai Murugan & R. Maria Irudhaya Aspin Chitra Proof: Let V[C n ] = { u i : i n }and E[C n ] = {{(u i u i+ ): i n-} {(u n u )}}. Case : Let C n be the graph whenn 0 (mod ). Let f: V[C n ] {, } defined by f(u i ) =, i. f(u i- ) =, i. when i (, f * (u i u i+ ) =, f * (u n u ) =. when i, f * (u i- u i ) =. It is clear that the lucky edge labeling of C n : n 0 (mod ) is {,, }. For example, Lucky edge labeling ofc is given in the figure a and η(c n ) =. Case : Let C n be the graph when n (mod ). Let f: V[C n ] {,, } defined by f(u i ) =, i. f(u i- ) =, i. f(u i )=, i (mod ) and i = n. when i, f * (u i u i+ ) =. when i, f * (u i- u i ) =. when i=n, f * (u i u ) = and f * (u i- u i ) =. It is clear that the lucky edge labeling of C n : n (mod ) is clearly {,,, }. For example, Lucky edge labeling of C is shown in the figure b and η(c n ) =. u u u u u u u u u Figure a and η(c n ) = Figure b and η(c n ) = International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 7
5 Lucky Edge Labeling of P n, C n and Corona of P n, C n Case : Let C n be the graph when n (mod ). Let f: V[C n ] {,, } defined by f(u i ) =, i ( f(u i- ) =, i ( f(u i )=, and i = n, n-. u u u u 7 u u 6 u u 6 u 6 u u u u Figure c and η(c n ) = 6 Figure d and η(c n ) = when i (, f * (u i u i+ ) =. when i ( f * (u i- u i ) =. when i= n- and n-, f * (u i u i+ ) =. f * (u n u ) =. It is clear that the lucky edge labeling of C n : n (mod ) is clearly {,,,, 6}. For example, Lucky edge labeling of C 6 is shown in the figure c and η(c n ) = 6. Case : Let C n be the graph when n (mod ). Let f: V[C n ] {,, } defined by f(u i ) =, i f(u i- ) =, i and i= n- f(u i )=, i (mod ). Then the induced edge coloring is when i, f * (u i u i+ ) =. when i, f * (u i- u i ) =. f * (u i- u i ) = and f * (u n u ) =. International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 7
6 Dr. A. Nellai Murugan & R. Maria Irudhaya Aspin Chitra It is clear that the lucky edge labeling of C n : n (mod )is clearly {,,, }. For example, Lucky edge labeling of C 7 is shown in the figure d and η(c n ) =. Hence,C n has lucky edge labeling graph. Theorem.: C + n : n 0,,, (mod ) has {a, b, c} lucky edge labeling for any a, b, c. Proof: Let V[C + n ] = {u i : i n} and {v i : i n} and E[C + n ] = {{(u i u i+ ): i n-} {(u n u )} {(u i v i ): i n}}. Case : Let C + n be the graph whenn 0 (mod ). Let f: V[C n ] {,, } defined by f(u i ) =, i. f(u i- ) =, i. f(v i ) =, i n. when i (, f * (u i u i+ ) =. f * (u n u ) =. when i, when i n, f * (u i- u i ) =. It is clear that the lucky edge labeling of C n + : n 0(mod ) is {,,, }. For example, Lucky edge labeling ofc + is shown in the figure a and η(c n + ) =. Case : Let C n + be the graph when n (mod ). Let f: V[C n + ] {,, } defined by f(u i ) =, i. f(u i- ) =, i. f(u i )=, i (mod ) and i = n. f(v ) =, f(v n- ) = f(v i ) =, i n. when i, f * (u i u i+ ) =. when i, when i=n, f * (u i- u i ) =. f * (u i u ) = and f * (u i- u i ) =. International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 7
7 Lucky Edge Labeling of P n, C n and Corona of P n, C n whenn- i n, f * (u v ) =. when i n-, It is clear that the lucky edge labeling of C n + :n (mod ) is {,,,, 6}. For example, Lucky edge labeling of C + is shown in the figure b and η(c n + ) = 6. Case : Let C n + be the graph when n (mod ). Let f: V[C n + ] {,, } defined by f(u i ) =, i ( f(u i- ) =, i ( f(u i )=, and i = n, n-. f(v ) =, i = n-, n- and f(v i ) =, i =, n. f(v i ) =, i n-. when i (, f * (u i u i+ ) = when i (, f * (u i- u i ) =. when i= n-, n-, f * (u i u i+ ) =. f * (u n u ) =. when i =, n-, when i n-, f * (u i v i ) =, i = n. It is clear that the lucky edge labeling of C n + :n (mod ) is {,,,, 6}. For example, Lucky edge labeling of C 6 + is shown in the figure c and η(c n + ) = 6. Case : Let C n + be the graph when n (mod ). Let f: V[C n + ] {,, } defined by f(u i ) =, i f(u i- ) =, i and i= n- f(u i )=, i (mod ). f(v i ) =,n- i n. f(v i ) =, i n-. International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 76
8 Dr. A. Nellai Murugan & R. Maria Irudhaya Aspin Chitra Figure a and η(c n + ) = Figure b and η(c n + ) = 6 Figure c and η(c + n ) = 6 Figure d and η(c + n ) = 6 when i, f * (u i u i+ ) = when i, f * (u i- u i ) =. f * (u i- u i ) =. f * (u n u ) =. whenn- i n, when i n-, International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 77
9 Lucky Edge Labeling of P n, C n and Corona of P n, C n It is clear that the lucky edge labeling of C n + :n (mod ) is {,,,, 6}. For example, Lucky edge labeling of C 7 + is shown in the figure d and η(c n + ) = 6. Hence,C n + has lucky edge labeling graph.. CONCLUSION Among all labelling lucky edge labelling has a special importance because it is incorporated with coloring of graphs REFERENCES [] GALLIAN.J.A,A Dynamical survey of graphs Labeling, The Electronic Journal of combinatorics. 6(00) #DS6. [] HARRARY.F, Graph Theory, Adadison-Wesley Publishing Company Inc, USA, 969. [] NELLAIMURUGAN.A- STUDIES IN GRAPH THEORY SOME LABELING PROBLEMS IN GRAPHS AND RELATED TOPICS,Ph.D, Thesis September 0... AUTHORS BIOGRAPHY Dr. A. Nellai Murugan is working as a Associate Professor in thedepartment of Mathematics, V.O. ChidambaramCollege, Tuticorin. He has 0 years of teachingexperience and 0 years of research experience. Hehas participated in number of conferences/seminar atnational and international level. He has publishedmore than 0 research article in the reputed research journals. He is guiding 6 Ph.D research scholars. R.Maria Irudhaya Aspin Chitra is a full time Ph.D Research Scholar working in Graph theory at Department of Mathematics, V.O. ChidambaramCollege, Tuticorin. She has communicated more research articles International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Page 78
SQUARE DIFFERENCE 3-EQUITABLE LABELING FOR SOME GRAPHS. Sattur , TN, India. Sattur , TN, India.
International Journal of Science, Engineering Technology Research (IJSETR), Volume 5, Issue, March 2016 SQUARE DIFFERENCE -EQUITABLE LABELING FOR SOME GRAPHS R Loheswari 1 S Saravana kumar 2 1 Research
More informationMagic Graphoidal on Class of Trees A. Nellai Murugan
Bulletin of Mathematical Sciences and Applications Online: 2014-08-04 ISSN: 2278-9634, Vol. 9, pp 33-44 doi:10.18052/www.scipress.com/bmsa.9.33 2014 SciPress Ltd., Switzerland Magic Graphoidal on Class
More informationSOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS. Sattur , TN, India.
SOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS A.Raja Rajeswari 1 and S.Saravana Kumar 1 Research Scholar, Department of Mathematics, Sri S.R.N.M.College, Sattur-66 03, TN, India. Department
More informationOdd-even sum labeling of some graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (017), 57-63. ISSN Print : 49-338 Odd-even sum labeling of some graphs ISSN Online : 319-515 K. Monika 1, K. Murugan 1 Department of
More informationOne Modulo Three Harmonic Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 4 (20), pp. 4-422 International Research Publication House http://www.irphouse.com One Modulo Three Harmonic Mean Labeling
More informationHarmonic Mean Labeling for Some Special Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 1 (2013), pp. 55-64 International Research Publication House http://www.irphouse.com Harmonic Mean Labeling for Some Special
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationPower Mean Labeling of Identification Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 6, Issue, 208, PP -6 ISSN 2347-307X (Print) & ISSN 2347-342 (Online) DOI: http://dx.doi.org/0.2043/2347-342.06000
More informationDifference Cordial Labeling of Graphs Obtained from Double Snakes
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 3 (013), pp. 317-3 International Research Publication House http://www.irphouse.com Difference Cordial Labeling of Graphs
More informationFixed Point Theorems for a Family of Self-Map on Rings
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 9, September 2014, PP 750-756 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Fixed
More informationMaximal Square Sum Subgraph of a Complete Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 1, January - 2014, PP 108-115 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Maximal
More informationIntegral Root Labeling of Graphs 1 V.L. Stella Arputha Mary & 2 N. Nanthini
International Journal of Mathematics Trends and Technology (IJMTT) Volume Number - February 08 Integral Root Labeling of Graphs V.L. Stella Arputha Mary & N. Nanthini Department of Mathematics, St. Mary
More informationChanging and unchanging of Total Dominating Color Transversal number of Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 4, April 216, PP 44-49 ISSN 2347-37X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/1.2431/2347-3142.446
More informationOdd Sum Labeling of Tree Related Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 4 (016), 11 16. ISSN: 347-1557 Available Online: http://ijmaa.in/ International Journal 347-1557 of Mathematics Applications And
More informationComplementary Acyclic Domination Chain in Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 3, Issue 3, March 2015, PP 33-39 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Complementary
More informationInternational Journal of Scientific Research and Reviews
Research article Available online www.ijsrr.org ISSN: 2279 0543 International Journal of Scientific Research and Reviews Fibonacci Prime Labeling of Udukkai and Octopus Graphs Chandrakala S. *1 and Sekar
More informationOn Odd Sum Graphs. S.Arockiaraj. Department of Mathematics. Mepco Schlenk Engineering College, Sivakasi , Tamilnadu, India. P.
International J.Math. Combin. Vol.4(0), -8 On Odd Sum Graphs S.Arockiaraj Department of Mathematics Mepco Schlenk Engineering College, Sivakasi - 66 00, Tamilnadu, India P.Mahalakshmi Department of Mathematics
More informationAvailable Online through
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com 0-EDGE MAGIC LABELING OF SHADOW GRAPH J.Jayapriya*, Department of Mathematics, Sathyabama University, Chennai-119,
More informationSuper Fibonacci Graceful Labeling
International J.Math. Combin. Vol. (010), -40 Super Fibonacci Graceful Labeling R. Sridevi 1, S.Navaneethakrishnan and K.Nagarajan 1 1. Department of Mathematics, Sri S.R.N.M.College, Sattur - 66 0, Tamil
More informationCycle Double Cover Conjecture
Cycle Double Cover Conjecture Paul Clarke St. Paul's College Raheny January 5 th 2014 Abstract In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture
More informationCombinatorial Labelings Of Graphs
Applied Mathematics E-Notes, 6(006), 51-58 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Combinatorial Labelings Of Graphs Suresh Manjanath Hegde, Sudhakar Shetty
More informationGraceful Labeling of Some Theta Related Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 78-84 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 11 September 2013 www.researchmathsci.org International Journal of Graceful Labeling of Some
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationDually Normal ADL. S. Ravi Kumar 1. G.C.Rao 2 1. DUAL ANNIHILATORS. s S, and hence the element s ( x a)
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 5, Issue 2, 2017, PP 11-15 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0502002
More informationThe Exquisite Integer Additive Set-Labeling of Graphs
The Exquisite Integer Additive Set-Labeling of Graphs N. K. Sudev 1, K. A. Germina 2 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501, Kerala, India.
More informationFurther Results on Square Sum Graph
International Mathematical Forum, Vol. 8, 2013, no. 1, 47-57 Further Results on Square Sum Graph K. A. Germina School of Mathematical and Physical Sciences Central University of Kerala, Kasaragode, India
More informationSUPER ROOT SQUARE MEAN LABELING OF SOME NEW GRAPHS
SUPER ROOT SQUARE MEAN LABELING OF SOME NEW GRAPHS 1 S.S.Sandhya S.Somasundaram and 3 S.Anusa 1.Department of Mathematics,Sree Ayyappa College for women,chunkankadai:69003,.department of Mathematics, Manonmaniam
More informationLaplacian Polynomial and Laplacian Energy of Some Cluster Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 5, May 2014, PP 448-452 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) wwwarcjournalsorg Laplacian Polynomial
More informationk-difference cordial labeling of graphs
International J.Math. Combin. Vol.(016), 11-11 k-difference cordial labeling of graphs R.Ponraj 1, M.Maria Adaickalam and R.Kala 1.Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-6741,
More informationROOT SQUARE MEAN GRAPHS OF ORDER 5
Available online at http://scik.org J. Math. Comput. Sci. 5 (2015), No. 5, 708-715 ISSN: 1927-5307 ROOT SQUARE MEAN GRAPHS OF ORDER 5 S.S. SANDHYA 1 S. SOMASUNDARAM 2 AND S. ANUSA 3,* 1 Department of Mathematics,
More informationRoot Square Mean Labeling of Some More. Disconnected Graphs
International Mathematical Forum, Vol. 10, 2015, no. 1, 25-34 HIKARI Ltd,www.m-hikari.com http://dx.doi.org/10.12988/imf.2015.411196 Root Square Mean Labeling of Some More Disconnected Graphs S. S. Sandhya
More informationSome Results on Super Mean Graphs
International J.Math. Combin. Vol.3 (009), 8-96 Some Results on Super Mean Graphs R. Vasuki 1 and A. Nagarajan 1 Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur - 68
More informationSkolem Difference Mean Graphs
royecciones Journal of Mathematics Vol. 34, N o 3, pp. 43-54, September 015. Universidad Católica del Norte Antofagasta - Chile Skolem Difference Mean Graphs M. Selvi D. Ramya Dr. Sivanthi Aditanar College
More informationOne Modulo Three Root Square Mean Labeling of Some Disconnected Graphs
Annals of Pure and Applied Mathematics Vol. 6, No. 2, 208, 255-263 ISSN: 2279-087X (P), 2279-0888(online) Published on February 208 www.researchmathsci.org DOI: http://dx.doi.org/0.2257/apam.v6n2a Annals
More informationSuper Mean Labeling of Some Classes of Graphs
International J.Math. Combin. Vol.1(01), 83-91 Super Mean Labeling of Some Classes of Graphs P.Jeyanthi Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur-68 15, Tamil Nadu,
More informationSome New Results on Super Stolarsky-3 Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 10, Number 1 (2018), pp. 7-20 International Research Publication House http://www.irphouse.com Some New Results on Super Stolarsky-3
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationSum divisor cordial labeling for star and ladder related graphs
Proyecciones Journal of Mathematics Vol. 35, N o 4, pp. 437-455, December 016. Universidad Católica del Norte Antofagasta - Chile Sum divisor cordial labeling for star and ladder related graphs A. Lourdusamy
More informationOn Graceful Labeling of Some Bicyclic Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 3, 2013, 1-8 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 4 October 2013 www.researchmathsci.org International Journal of On Graceful Labeling of Some
More informationApplication of Fixed point Theorem in Game Theory
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 5, May 2014, PP 469-473 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Application
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More informationA Class of Vertex Transitive Graphs
Volume 119 No. 16 2018, 3137-3144 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ A Class of Vertex Transitive Graphs 1 N. Murugesan, 2 R. Anitha 1 Assistant
More informationEven Star Decomposition of Complete Bipartite Graphs
Journal of Mathematics Research; Vol. 8, No. 5; October 2016 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Even Star Decomposition of Complete Bipartite Graphs E.
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationOn Almost Supra N-continuous Function
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 3, Issue 7, July 2015, PP 20-25 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Almost Supra
More informationOn Pseudo SCHUR Complements in an EP Matrix
International Journal of Scientific Innovative Mathematical Research (IJSIMR) Volume, Issue, February 15, PP 79-89 ISSN 47-7X (Print) & ISSN 47-4 (Online) wwwarcjournalsorg On Pseudo SCHUR Complements
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationCharacterization of Quasigroups and Loops
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 1, Issue 2, October - 2013, PP 95-102 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Characterization
More informationApplication of Balancing Numbers in Effectively Solving Generalized Pell s Equation
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 2, February 2014, PP 156-164 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Application
More informationA total coloring of a graph G in an assignment of colors to the vertices and edges of G such that no two adjacent or incident
International Journal of Scientific and Research Publications, Volume 7, Issue 7, July 2017 616 Total Coloring of Closed Helm, Flower and Bistar Graph Family R. ARUNDHADHI *, V. ILAYARANI ** * Department
More informationOn the Gracefulness of Cycle related graphs
Volume 117 No. 15 017, 589-598 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu On the Gracefulness of Cycle related graphs S.Venkatesh 1 and S. Sivagurunathan
More informationOn P 2 P n -Supermagic Labeling of Edge Corona Product of Cycle and Path Graph
On P P n -Supermagic Labeling of Edge Corona Product of Cycle and Path Graph Riza Yulianto and Titin Sri Martini Mathematics Department of Mathematics and Natural Sciences Faculty, Universitas Sebelas
More informationTotal Dominator Colorings in Paths
International J.Math. Combin. Vol.2(2012), 89-95 Total Dominator Colorings in Paths A.Vijayalekshmi (S.T.Hindu College, Nagercoil, Tamil Nadu, India) E-mail: vijimath.a@gmail.com Abstract: Let G be a graph
More informationDistance labelings: a generalization of Langford sequences
Also available at http://amc-journal.eu ISSN -9 (printed edn.), ISSN -9 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Distance labelings: a generalization of Langford sequences S. C. López Departament
More informationDISTANCE LABELINGS: A GENERALIZATION OF LANGFORD SEQUENCES. 1. Introduction
DISTANCE LABELINGS: A GENERALIZATION OF LANGFORD SEQUENCES S. C. LÓPEZ AND F. A. MUNTANER-BATLE Abstract. A Langford sequence of order m and defect d can be identified with a labeling of the vertices of
More informationGraceful Labeling for Complete Bipartite Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department
More informationCHROMATIC EXCELLENCE IN FUZZY GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 305-315 DOI: 10.7251/BIMVI1702305D Former BULLETIN
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationON SUPER HERONIAN MEAN LABELING OF GRAPHS
ON SUPER HERONIAN MEAN LABELING OF GRAPHS S.S.Sandhya Department of Mathematics, Sree Ayyappa College for Women, Chunkankadai- 00,Tamilnadu,India. E.Ebin Raja Merly Department of Mathematics, Nesamony
More informationSome Elementary Problems from the Note Books of Srinivasa Ramanujan-Part (III)
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 2, February 2014, PP 125-138 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Some
More informationA Study on Integer Additive Set-Graceful Graphs
A Study on Integer Additive Set-Graceful Graphs N. K. Sudev arxiv:1403.3984v3 [math.co] 27 Sep 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur, India. E-mail:
More informationOn (k, d)-multiplicatively indexable graphs
Chapter 3 On (k, d)-multiplicatively indexable graphs A (p, q)-graph G is said to be a (k,d)-multiplicatively indexable graph if there exist an injection f : V (G) N such that the induced function f :
More informationSuper Root Square Mean Labeling Of Disconnected Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 1 C (2016), 93 98. ISSN: 2347-1557 Available Online: http://ijmaa.in/ International Journal 2347-1557 of Mathematics Applications
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationInverse and Disjoint Restrained Domination in Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 11, No.1, 2016, 9-15 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 17 August 2016 www.researchmathsci.org International Journal of Inverse and Disjoint
More informationArithmetic ODD Decomposition of Extented Lobster
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-300 Volume 4, Number 1 (01), pp. 35-4 International Research Publication House http://www.irphouse.com Arithmetic ODD Decomposition
More informationDepartment of Mathematics, Sri Krishna Institute of Technology, Bengaluru , Karnataka, India. *Correspondence author s
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 6393-6406 Research India Publications http://www.ripublication.com ON SUPER (a, d)-anti-edgemagic OF C m ok
More informationOriented vertex and arc colorings of outerplanar graphs
Information Processing Letters 100 (2006) 97 104 www.elsevier.com/locate/ipl Oriented vertex and arc colorings of outerplanar graphs Alexandre Pinlou,1, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours
More informationSuper Fibonacci Graceful Labeling of Some Special Class of Graphs
International J.Math. Combin. Vol.1 (2011), 59-72 Super Fibonacci Graceful Labeling of Some Special Class of Graphs R.Sridevi 1, S.Navaneethakrishnan 2 and K.Nagarajan 1 1. Department of Mathematics, Sri
More informationODD HARMONIOUS LABELING OF PLUS GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 303-4874, ISSN (o) 303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 515-56 DOI: 10.751/BIMVI1703515J Former BULLETIN OF THE
More informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
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 informationOn Z 3 -Magic Labeling and Cayley Digraphs
Int. J. Contemp. Math. Sciences, Vol. 5, 00, no. 48, 357-368 On Z 3 -Magic Labeling and Cayley Digraphs J. Baskar Babujee and L. Shobana Department of Mathematics Anna University Chennai, Chennai-600 05,
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationCRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES. Ahmed Bouchou and Mostafa Blidia
Opuscula Math. 36, no. 5 (2016, 563 574 http://dx.doi.org/10.7494/opmath.2016.36.5.563 Opuscula Mathematica CRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES Ahmed Bouchou and Mostafa Blidia
More informationTHE LOCATING-CHROMATIC NUMBER OF DISCONNECTED GRAPHS
Far East Journal of Mathematical Sciences (FJMS) 2014 Pushpa Publishing House, Allahabad, India Published Online: December 2014 Available online at http://pphmj.com/journals/fjms.htm Volume 94, Number
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationCycle decompositions of the complete graph
Cycle decompositions of the complete graph A.J.W. Hilton Department of Mathematics University of Reading Whiteknights P.O. Box 220 Reading RG6 6AX U.K. Matthew Johnson Department of Mathematics London
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501, India. K. A. Germina PG & Research
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev arxiv:1504.07132v1 [math.gm] 23 Apr 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationL(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs
MATEMATIKA, 2014, Volume 30, Number 2, 109-116 c UTM Centre for Industrial and Applied Mathematics L(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs Murugan Muthali Tamil Nadu Open University
More informationSUPER MEAN NUMBER OF A GRAPH
Kragujevac Journal of Mathematics Volume Number (0), Pages 9 0. SUPER MEAN NUMBER OF A GRAPH A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ Abstract. Let G be a graph and let f : V (G) {,,..., n} be a function
More informationTopological Integer Additive Set-Graceful Graphs
Topological Integer Additive Set-Graceful Graphs N. K.Sudev arxiv:1506.01240v1 [math.gm] 3 Jun 2015 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501,
More informationarxiv: v2 [math.co] 26 Apr 2014
Super edge-magic deficiency of join-product graphs arxiv:1401.45v [math.co] 6 Apr 014 A.A.G. Ngurah 1 Department of Civil Engineering Universitas Merdeka Malang Jalan Taman Agung No. 1 Malang, Indonesia
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationResearch Article Some New Results on Prime Cordial Labeling
ISRN Combinatorics Volume 014, Article ID 07018, 9 pages http://dx.doi.org/10.1155/014/07018 Research Article Some New Results on Prime Cordial Labeling S. K. Vaidya 1 andn.h.shah 1 Saurashtra University,
More informationT -choosability in graphs
T -choosability in graphs Noga Alon 1 Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. and Ayal Zaks 2 Department of Statistics and
More informationNowhere-zero Unoriented Flows in Hamiltonian Graphs
Nowhere-zero Unoriented Flows in Hamiltonian Graphs S. Akbari 1,5, A. Daemi 2, O. Hatami 1, A. Javanmard 3, A. Mehrabian 4 1 Department of Mathematical Sciences Sharif University of Technology Tehran,
More informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More information