Heronian Mean Labeling of. Disconnected Graphs
|
|
- Georgina Nichols
- 5 years ago
- Views:
Transcription
1 International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 5, HIKARI Ltd, Heronian Mean Labeling of Disconnected Graphs S.S. Sandhya Department of Mathematics Sree Ayyappa College for Women Chunkankadai , Tamilnadu, India E. Ebin Raja Merly Department of Mathematics Nesamony Memorial Christian College Marthandam , Tamilnadu, India S.D. Deepa Nesamony Memorial Christian College Marthandam , Tamilnadu, India Copyright 2017 S.S. Sandhya et al. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper, we contribute some new results for Heronian Mean labeling of graphs. We prove that disconnected Heronian Mean Graphs are Heronian Mean Graphs. We use some standard graphs to derive the results for disconnected graphs. Mathematics Subject Classification: 05C78 Keywords: Graph, Heronian Mean Graph, Path, Cycle, Comb, Ladder, Triangular Snake, Quadrilateral Snake
2 202 S.S. Sandhya et al. 1. Introduction By a graph we mean a finite undirected graph without loops or parallel edges. For all detailed survey of graph labeling, we refer to J.A. Gallian [1]. For all other standard terminology and notations we follow Harary [2]. The concept of Mean labeling has been introduced by S. Somasundaram and R. Ponraj [3] in S. Somasundaram and S.S. Sandhya introduced Harmonic mean labeling [4] in Motivated by the above works we introduced a new type of labeling called Heronian Mean Labeling in [5]. In this paper we investigate the Heronian Mean Labeling of some disconnected graphs. We will provide brief summary of definitions and other information which are necessary for our present investigation. A Path P n is a walk in which all the vertices are distinct. A Cycle C n is a Closed Path. The graph obtained by joining a single pendant edge to each vertex of a Path is called a Comb. The corona G 1 ʘ G 2 is defined as the graph G obtained by taking one copy of G 1 (which has P 1 vertices) and P 1 copies of G 2 and then joining the i th vertex of G 1 to every vertices in the i th copy of G 2. The graph C n ʘ K 1 is called crown. The Ladder L n is the product graph P 2 P n. A Triangular Snake T n is obtained from a path u1,u2,.un by joining ui and ui+1 to a new vertex vi for 1 i n 1. That is every edge of a path is replaced by a triangle C 3. A Quadrilateral Snake Q n is obtained from a path u1,u2,.un by joining ui and ui+1 to two new vertices vi and wi respectively and then joining vi and wi. That is every edge of a path is replaced by a cycle C 4. Definition 1.1: A graph G=(V,E) with p vertices and q edges is said to be a Heronian Mean graph if it is possible to label the vertices x V with distinct labels f(x) from 1,2,,q+1 in such a way that when each edge e = uv is labeled with, f(u) + f(u)f(v) + f(v) f(u) + f(u)f(v) + f(v) f(e = uv) = (OR) 3 3 Then the edge labels are distinct. In this case f is called a Heronian Mean labeling of G. Theorem 1.2: Any Path P n is a Heronian mean graph. Theorem 1.3: Any Comb P n ʘK 1 is a Heronian mean graph. Theorem 1.4: Any Cycle C n is a Heronian mean graph. Theorem 1.5: Crown, C n ʘK 1 is a Heronian mean graph for all n 3. Theorem 1.6: Any Triangular Snake T n is a Heronian mean graph. Theorem 1.7: Any Quadrilateral Snake Q n is a Heronian mean graph. Theorem 1.8: Any Ladder L n is a Heronian mean graph.
3 Heronian mean labeling of disconnected graphs Main Results Theorem: 2.1 P m P n is a Heronian mean graph. Let Pm be a path u1u2u3.um and Pn be a path v1v2v3.vn Define a function f: V(P m P n ) {1,2,3,.., q + 1} by f(u i ) = i, 1 i m. Edges are labeled with, f(u i u i+1 ) = i, 1 i m, f(v i v i+1 ) = i, Hence P m P n is a Heronian mean graph. f(v i ) = m + i, Example 2.2: A Heronian mean labeling of P 5 P 4 is given below. Figure: 1 Theorem: 2.3 C m P n is a Heronian mean graph for m 3 and n > 1. Let C m be the cycle u1u2u3.umu1 and Pn be a path v1v2v3.vn Define a function f: V(C m P n ) {1,2,3,, q + 1} by f(u i ) = i, 1 i m. Edges of C m are labeled by f(u i u i+1 ) = i + 1, 1 i m, f(u m u 1 ) = 1 Edges of P n are labeled by {m + 1, m + 2, m + n 1}. Hence C m P n is a Heronian mean graph if m 3 and n > 1. f(v i ) = m + i, Example 2.4: A Heronian mean labeling of C 5 P 4 is given below.
4 204 S.S. Sandhya et al. Figure: 2 Theorem: 2.5 C m (P n ʘ K 1 ) is a Heronian mean graph for m 3 and n > 1. Let C m be the cycle u1u2u3.umu1 and P n ʘ K 1 be a graph obtained from a path v 1 v 2. v n by joining the vertex v i to pendant vertices w i Define a function, f: V(C m (P n ʘ K 1 ) ) {1,2,3,. q + 1} by f(u i ) = i, 1 i m f(v i ) = m + (2i 1), 1 i n f(w i ) = m + 2i, We get distinct edge labels for C m. Edges of P n ʘ K 1 are labeled by {m + 1, m + 2, m + 2n 1}. Hence C m (P n ʘ K 1 ) is a Heronian mean graph if m 3 and n > 1. Example 2.6: A Heronian mean labeling of C 4 (P 5 ʘ K 1 ) is given below. Figure: 3 Theorem: 2.7 (C m ʘ K 1 ) P n is a Heronian mean graph for m 3 and n > 1. Let C m ʘ K 1 be the cycle u1u2u3.umu1 by joining the vertex u i to pendant vertices v i and let Pn be a path w1w2w3.wn Define a function, f: V((C m ʘ K 1 ) P n ) {1,2,3,. q + 1} by f(u i ) = 2i, 1 i m
5 Heronian mean labeling of disconnected graphs 205 f(v i ) = 2i 1, f(w i ) = m + i, 1 i m We get distinct edge labels for C m ʘ K 1. Edges of P n are labeled by {2m + 1,2m + 2, 2m + n 1}. Hence (C m ʘ K 1 ) P n is a Heronian mean graph if m 3 and n > 1. Example 2.8: A Heronian mean labeling of (C 3 ʘ K 1 ) P 6 is given below. Figure: 4 Theorem: 2.9 C m (C n ʘ K 1 ) is a Heronian mean graph for m 3 and n 3. Let C m be the cycle u1u2u3.umu1 and C n ʘ K 1 be a graph obtained from a path v 1 v 2. v n by joining the vertex v i to pendant vertices w i Define a function, f: V(C m (C n ʘ K 1 ) ) {1,2,3,. q + 1} by f(u i ) = i, 1 i m f(v i ) = m + 2i, 1 i n f(w i ) = m + (2i 1), We get distinct edge labels for C m and C n ʘ K 1. Hence C m (C n ʘ K 1 ) is a Heronian mean graph if m 3 and n 3. Example 2.10: A Heronian mean labeling of C 4 (C 3 ʘ K 1 ) is given below. Figure: 5
6 206 S.S. Sandhya et al. Theorem: 2.11 C m L n is a Heronian mean graph for m 3 and n > 1. Let C m be the cycle u1u2u3.umu1 and L n be a ladder connecting two paths v 1 v 2. v n and w 1 w 2. w n. Define a function, f: V(C m L n ) {1,2,3,. q + 1} by f(u i ) = i, 1 i m f(v i ) = m + (3i 2), 1 i n f(w i ) = m + (3i 1), We get distinct edge labels for C m. Edges of L n are labeled by {m + 1, m + 2, m + 3n 2}. Hence C m L n is a Heronian mean graph if m 3 and n > 1. Example 2.12: A Heronian mean labeling of C 4 L 5 is given below. Figure: 6 Theorem: 2.13 (C m ʘ K 1 ) L n is a Heronian mean graph for m 3 and n > 1. Let C m ʘ K 1 be a graph obtained from the cycle u1u2u3.umu1 by joining the vertex u i to pendant vertices v i and let Ln be a ladder connecting two paths x 1 x 2. x n and y 1 y 2. y n Define a function, f: V((C m ʘ K 1 ) L n ) {1,2,3,. q + 1} by f(u i ) = 2i, 1 i m f(v i ) = 2i 1, 1 i m f(x i ) = m + (3i 2), f(y i ) = m + (3i 1), 1 i n We get distinct edge labels for C m ʘ K 1. Edges of L n are labeled by {2m + 1,2m + 2, 2m + 3n 2}. Hence (C m ʘ K 1 ) L n is a Heronian mean graph if m 3 and n > 1.
7 Heronian mean labeling of disconnected graphs 207 Example 2.14: A Heronian mean labeling of (C 3 ʘ K 1 ) L 5 is given below. Figure: 7 Theorem: 2.15 (C m ʘ K 1 ) (P n ʘ K 1 ) is a Heronian mean graph for m 3 and n > 1. Let C m ʘ K 1 be a graph obtained from the cycle u1u2u3.umu1 by joining the vertex u i to pendant vertices v i and let P n ʘ K 1 be a graph obtained from a path x 1 x 2. x n by joining the vertex x i to pendant vertices y i Define a function, f: V((C m ʘ K 1 ) (P n ʘ K 1 ) ) {1,2,3,. q + 1} by f(u i ) = 2i, 1 i m f(v i ) = 2i 1, 1 i m f(x i ) = m + (2i 1), f(y i ) = m + 2i, 1 i n We get distinct edge labels for C m ʘ K 1. Edges of P n ʘ K 1 are labeled by {2m + 1,2m + 2, 2m + 2n 1}. Hence (C m ʘ K 1 ) (P n ʘ K 1 ) s a Heronian mean graph if m 3 and n > 1. Example 2.16: A Heronian mean labeling of (C 3 ʘ K 1 ) (P 5 ʘ K 1 ) below. is given Figure: 8
8 208 S.S. Sandhya et al. 3. Conclusion The Study of labeled graph is important due to its diversified applications. It is very interesting to investigate disconnected graphs which admit Heronian Mean Labeling. The derived results are demonstrated by means of sufficient illustrations which provide better understanding. It is possible to investigate similar results for several other graphs. Acknowledgements. The authors are thankful to the referee for their valuable comments and suggestions. References [1] J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, (2013). [2] F. Harary, Graph Theory, Narosa Publishing House, New Delhi, [3] S. Somasundaram and R. Ponraj, Mean Labeling of graphs, National Academy of Science Letters, 26 (2003), [4] S. Somasundaram, R. Ponraj and S.S. Sandhya, Harmonic Mean Labeling of Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear. [5] S.S. Sandhya, E. Ebin Raja Merly and S.D. Deepa, Heronian Mean Labeling of Graphs, International Mathematical Forum, 12 (2017), no. 15, [6] S.S. Sandhya, E. Ebin Raja Merly and S.D. Deepa, Some Results on Heronian Mean Labeling of Graphs, Journal of Discrete Mathematical Sciences and Cryptography, to appear. Received: August 17, 2016; Published: July 17, 2017
Heronian 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 Results on Super Heronian Mean. Labeling of Graphs
International Journal of Contemporary Mathematical Sciences Vol., 0, no. 0, - 9 HIKARI Ltd, www.m-hikari.com https://doi.org/0.9/ijcms.0. Some Results on Super Heronian Mean Labeling of Graphs S. S. Sandhya
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 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 informationOn Geometric Mean Graphs
International Mathematical Forum, Vol. 10, 2015, no. 3, 115-125 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2015.412198 On Geometric Mean Graphs 1 S. Somasundaram, 2 S. S. Sandhya and 3
More informationRoot Cube Mean Labeling of Graphs
International Journal of Engineering Science, Advanced Computing and Bio-Technology Vol 8, No 4, October December 07, pp 48-55 Root Cube Mean Labeling of Graphs R Gowri and *G Vembarasi Department of mathematics
More informationGeometric mean labeling of some more Disconnected Graphs
Geometric mean labeling of some more Disconnected Graphs S 1.P.Viji, S 2. Somasundaram, S3.S.Sandhya, 1. Department of Mathematics, K.N.S.K. College of Engineering, Therekalputhoor 629004 2. Department
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 informationRadio mean labeling of Path and Cycle related graphs
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-300 Volume 9, Number 3 (017), pp. 337-345 International Research Publication House http://www.irphouse.com Radio mean labeling of
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 informationON SOME LABELINGS OF LINE GRAPH OF BARBELL GRAPH
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 10 017, 148 156 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu ON SOME LABELINGS
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 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 informationVertex-Mean Graphs. A.Lourdusamy. (St.Xavier s College (Autonomous), Palayamkottai, India) M.Seenivasan
International J.Math. Combin. Vol. (0), -0 Vertex-Mean Graphs A.Lourdusamy (St.Xavier s College (Autonomous), Palayamkottai, India) M.Seenivasan (Sri Paramakalyani College, Alwarkurichi-67, India) E-mail:
More informationDomination Number of Jump Graph
International Mathematical Forum, Vol. 8, 013, no. 16, 753-758 HIKARI Ltd, www.m-hikari.com Domination Number of Jump Graph Y. B. Maralabhavi Department of Mathematics Bangalore University Bangalore-560001,
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 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 informationSOME RESULTS ON n-edge MAGIC LABELING part 2
International Journal of Scientific & Engineering Research, Volume 7, Issue 4, April-2016 1453 SOME RESULTS ON n-edge MAGIC LABELING part 2 S.Vimala, Assistant Professor, Department of Mathematics, Mother
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 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 informationSOME GRAPHS WITH n- EDGE MAGIC LABELING
SOME GRAPHS WITH n- EDGE MAGIC LABELING Neelam Kumari 1, Seema Mehra 2 Department of mathematics, M. D. University Rohtak (Haryana), India Abstract: In this paper a new labeling known as n-edge magic labeling
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 informationEdge-Magic Labeling of some Graphs
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 47-51 Research India Publications http://www.ripublication.com Edge-Magic Labeling of some Graphs A.
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 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 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 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 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 informationSome Cordial Labeling of Duplicate Graph of Ladder Graph
Annals of Pure and Applied Mathematics Vol. 8, No. 2, 2014, 43-50 ISSN: 2279-087X (P), 2279-0888(online) Published on 17 December 2014 www.researchmathsci.org Annals of Some Cordial Labeling of Duplicate
More informationPrime Labeling for Some Cycle Related Graphs
Journal of Mathematics Research ISSN: 1916-9795 Prime Labeling for Some Cycle Related Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University Rajkot 360 005, Gujarat,
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 informationPrime Labeling For Some Octopus Related Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 6 Ver. III (Nov. - Dec.2016), PP 57-64 www.iosrjournals.org Prime Labeling For Some Octopus Related Graphs A.
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 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 informationInternational Research Journal of Engineering and Technology (IRJET) e-issn:
SOME NEW OUTCOMES ON PRIME LABELING 1 V. Ganesan & 2 Dr. K. Balamurugan 1 Assistant Professor of Mathematics, T.K. Government Arts College, Vriddhachalam, Tamilnadu 2 Associate Professor of Mathematics,
More informationTopological Integer Additive Set-Sequential Graphs. Received: 7 April 2015 / Accepted: 26 June 2015 / Published: 3 July 2015
Mathematics 2015, 3, 604-614; doi:10.3390/math3030604 OPEN ACCESS mathematics ISSN 2227-7390 www.mdpi.com/journal/mathematics Article Topological Integer Additive Set-Sequential Graphs Sudev Naduvath 1,
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 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 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 informationMore on Permutation Labeling of Graphs
International Journal of Applied Graph Theory Vol.1, No. (017), 30-4. ISSN(Online) : 456 7884 More on Permutation Labeling of Graphs G. V. Ghodasara Department of Mathematics H. & H. B. Kotak Institute
More informationRectilinear Crossing Number of a Zero Divisor Graph
International Mathematical Forum, Vol. 8, 013, no. 1, 583-589 HIKARI Ltd, www.m-hikari.com Rectilinear Crossing Number of a Zero Divisor Graph M. Malathi, S. Sankeetha and J. Ravi Sankar Department of
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 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 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 informationOn Locating Domination Number of. Boolean Graph BG 2 (G)
International Mathematical Forum, Vol. 12, 2017, no. 20, 973-982 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.7977 On Locating Domination Number of Boolean Graph BG 2 (G) M. Bhanumathi
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 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 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 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 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 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 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 informationMonophonic Chromatic Parameter in a Connected Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 19, 911-920 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.78114 Monophonic Chromatic Parameter in a Connected Graph M.
More informationThe Cover Pebbling Number of the Join of Some Graphs
Applied Mathematical Sciences, Vol 8, 2014, no 86, 4275-4283 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ams201445377 The Cover Pebbling Number of the Join of Some Graphs Michael E Subido and Imelda
More informationRainbow Vertex-Connection Number of 3-Connected Graph
Applied Mathematical Sciences, Vol. 11, 2017, no. 16, 71-77 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.612294 Rainbow Vertex-Connection Number of 3-Connected Graph Zhiping Wang, Xiaojing
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 informationVertex Odd Mean and Even Mean Labeling of Fan Graph, Mongolian Tent and K 2 + C n
International Journal of Mathematics And its Applications Volume 4, Issue 4 (016), 3 7. (Special Issue) ISSN: 347-1557 Available Online: http://ijmaa.in/ International Journal 347-1557 of Mathematics Applications
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 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 informationOdd Harmonious Labeling of Some Graphs
International J.Math. Combin. Vol.3(0), 05- Odd Harmonious Labeling of Some Graphs S.K.Vaidya (Saurashtra University, Rajkot - 360005, Gujarat, India) N.H.Shah (Government Polytechnic, Rajkot - 360003,
More informationSigned Product Cordial labeling in duplicate graphs of Bistar, Double Star and Triangular Ladder Graph
Signed Product Cordial labeling in duplicate graphs of Bistar Double Star Triangular Ladder Graph P.P Ulaganathan #1 B. Selvam #2 P. Vijaya kumar #3 12 Department of Mathematics S.I.V.E.T College Gowrivakkam
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 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 informationResearch Article Harmonious Properties of Uniform k-distant Trees
Chinese Mathematics Volume 013, Article ID 75451, 4 pages http://dx.doi.org/10.1155/013/75451 Research Article Harmonious Properties of Uniform k-distant Trees M. Murugan School of Science, Tamil Nadu
More informationA Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs
Applied Mathematics E-Notes, 15(015), 9-37 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs Naduvath
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More informationThe Number of Fuzzy Subgroups of Cuboid Group
International Journal of Algebra, Vol. 9, 2015, no. 12, 521-526 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2015.5958 The Number of Fuzzy Subgroups of Cuboid Group Raden Sulaiman Department
More informationDominator Coloring of Prism Graph
Applied Mathematical Sciences, Vol. 9, 0, no. 38, 889-89 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ams.0.7 Dominator Coloring of Prism Graph T. Manjula Department of Mathematics, Sathyabama
More informationTOTAL SEQUENTIAL CORDIAL LABELING OF UNDIRECTED GRAPHS
National Journal on Advances in Computing & Management Vol. 4 No. 2 Oct 2013 9 TOTAL SEQUENTIAL CORDIAL LABELING OF UNDIRECTED GRAPHS Parameswari.R 1, Rajeswari.R 2 1 Research Scholar,Sathyabama University,
More informationConnected Liar s Domination in Graphs: Complexity and Algorithm 1
Applied Mathematical Sciences, Vol. 12, 2018, no. 10, 489-494 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.8344 Connected Liar s Domination in Graphs: Complexity and Algorithm 1 Chengye
More informationInternational Journal of Mathematical Archive-7(9), 2016, Available online through ISSN
International Journal of Mathematical Archive-7(9), 2016, 189-194 Available online through wwwijmainfo ISSN 2229 5046 TRIPLE CONNECTED COMPLEMENTARY ACYCLIC DOMINATION OF A GRAPH N SARADHA* 1, V SWAMINATHAN
More informationStrong and Semi Strong Outer Mod Sum Graphs
Int. Journal of Math. Analysis, Vol. 7, 013, no., 73-83 Strong and Semi Strong Outer Mod Sum Graphs M. Jayalakshmi and B. Sooryanarayana Dept.of Mathematical and Computational Studies Dr.Ambedkar Institute
More informationThe Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 6, June 2016, PP 23-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0406005
More informationGovernment Arts College, Melur , Tamilnadu, India. pons
Volume 118 No. 10 018, 97-109 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.173/ijpam.v118i10.53 ijpam.eu ODD VERTEX MAGIC TOTAL LABELING OF SOME
More informationON HARMONIOUS COLORINGS OF REGULAR DIGRAPHS 1
Volume 1 Issue 1 July 015 Discrete Applied Mathematics 180 (015) ON HARMONIOUS COLORINGS OF REGULAR DIGRAPHS 1 AUTHORS INFO S.M.Hegde * and Lolita Priya Castelino Department of Mathematical and Computational
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 informationOn the Sum and Product of Covering Numbers of Graphs and their Line Graphs
Communications in Mathematics Applications Vol. 6, No. 1, pp. 9 16, 015 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com On the Sum Product of Covering
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationGraph Labelings in Konigsberg Bridge Problem
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 5 Ver. II (Sep. - Oct. 2015), PP 29-36 www.iosrjournals.org Graph Labelings in Konigsberg Bridge Problem N.
More information-edge magic total labelingfor the extended duplicate graph of quadrilateral snake Z 3. -vertex magic total labeling and Z 3
Journal of Physics: Conference Series PAPER OPEN ACCESS Z 3 -vertex magic total labeling and Z 3 -edge magic total labelingfor the extended duplicate graph of quadrilateral snake Related content - E-cordial
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 informationOn Strongly *-Graphs
Proceedings of the Pakistan Academy of Sciences: A. Physical and Computational Sciences 54 (2): 179 195 (2017) Copyright Pakistan Academy of Sciences ISSN: 2518-4245 (print), 2518-4253 (online) Pakistan
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 informationThe b-chromatic Number of Bistar Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 116, 5795-5800 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.47529 The b-chromatic Number of Bistar Graph Immanuel T. San Diego and Frederick
More informationODD VERTEX MAGIC TOTAL LABELING OF TREES CT. NAGARAJ#1,C.Y. PONNAPPAN?1, G. PRABAKARAN#2 1
ODD VERTEX MAGIC TOTAL LABELING OF TREES CT NAGARAJ#1,CY ONNAAN?1, G RABAKARAN# 1 Research Scholar, Department of Mathematics Research and Development centre Bharathiar University, Coimbatore-641046, Tamilnadu,
More informationInternational Journal of Pure and Applied Mathematics
Volume 115 No. 9 017, 363-375 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu EVEN VERTEX MAGIC TOTAL LABELING C.T. NAGARAJ Research Scholar, Department
More informationDecomposition of Complete Graphs. into Union of Stars
Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 1, 11-17 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.310114 Decomposition of Complete Graphs into Union of Stars Ancykutty Joseph*
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More informationComplete Bipartite Graphs with No Rainbow Paths
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 10, 455-462 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2016.6951 Complete Bipartite Graphs with No Rainbow
More informationCordial Labeling on Aztec Diamond Graphs Dr. K.Ameenal Bibi 1, T.Ranjani 2 1,2 P.G and Research Department of Mathematics,
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (rint): 2279-47 ISSN (Online): 2279-55 International
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 informationSuper Fibonacci Graceful Labeling Of Some Cycle Related Graphs
International Journal of Mathematics Trends and Technology (IJMTT) Volume 3 Number 3 - October06 Super Fibonacci Graceful Labeling Of Some Cycle Related Graphs D.Amuthavalli, M. Premkumar Assistant Professor
More informationEccentric domination in splitting graph of some graphs
Advances in Theoretical and Applied Mathematics ISSN 0973-4554 Volume 11, Number 2 (2016), pp. 179-188 Research India Publications http://www.ripublication.com Eccentric domination in splitting graph of
More informationOn Cordial Labeling: Gluing of Paths and Quadrilateral Snake Graphs on Cycle Graph
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 4 (2016), pp. 3559 3567 Research India Publications http://www.ripublication.com/gjpam.htm On Cordial Labeling: Gluing of
More informationEquitable Coloring on Triple Star Graph Families
International J.Math. Combin. Vol.2(2018), 24-32 Equitable Coloring on Triple Star Graph Families K.Praveena (Department of Computer Science, Dr.G.R. Damodaran College of Science, Coimbatore-641014, Tamilnadu,
More informationEnnumeration of the Number of Spanning Trees in the Lantern Maximal Planar Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 74, 3661-3666 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.44312 Ennumeration of the Number of Spanning Trees in the Lantern Maximal
More informationGenerating Topology on Graphs by. Operations on Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 57, 2843-2857 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.5154 Generating Topology on Graphs by Operations on Graphs M. Shokry Physics
More informationON DIFFERENCE CORDIAL GRAPHS
Mathematica Aeterna, Vol. 5, 05, no., 05-4 ON DIFFERENCE CORDIAL GRAPHS M. A. Seoud Department of Mathematics, Faculty of Science Ain Shams University, Cairo, Egypt m.a.seoud@hotmail.com Shakir M. Salman
More informationA Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1
International Mathematical Forum, Vol. 11, 016, no. 14, 679-686 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/imf.016.667 A Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1 Haihui
More information