PL EN


Preferences help
enabled [disable] Abstract
Number of results
2021 | 156 | 176-191
Article title

Some results on centered triangular graceful graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
Let G be a graph with p vertices and q edges. The nth centered triangular number is denoted by C_n, where C_n = 1/2 (3n2 - 3n + 2). A centered triangular graceful labeling of a graph G is a one-to-one function f : V (G) → {0,1,…C_q} that induces a bijection f *: E(G) →{C_1 〖,C〗_2,…C_q} of the edges of G defined by f * (e) = │f(u) - f(v)│, for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular graceful graph.
Year
Volume
156
Pages
176-191
Physical description
Contributors
author
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
author
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
References
  • [1] F. Harary, Graph Theory, Adision – Wesley, Reading Mass, 1969.
  • [2] K. R. Parthasarathy. Basic Graph Theory, Tata Mcgraw Hill Publishing Company Limited (1994).
  • [3] J. A. Bondy and U. S. R. Murty. Graph Theory with Applications, Macmillan Press, London (1976).
  • [4] M. Apostal, Introduction to Analytic Number Theory, Narosa Publishing House, Second Edition, 1991.
  • [5] I. Niven and Herbert S. Zuckerman. An Introduction to the Theory of Numbers, Wiley Eastern Limited, Third Edition, 1991.
  • [6] A. Rosa, On certain valuation of the vertices of a graph, Thoery of Graphs (Proc. Internat. Symposium, Rome, 1966), Gordon and Breach, N. Y and Dunod Paris (1967), 349-355.
  • [7] S.W. Golomb, How to number a Graph, Graph Theory and Computing, R.C. Read, Academic Press, New York (1972).
  • [8] J.A.Gallian, A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 22 (2019) #DS6
  • [9] F. Harary, Sum Graphs and Difference Graphs. Congr. Numer. 72 (1990) 101-108
  • [10] F. Harary, I. R. Hentzel and D. Jacobs Digitizing Sum Graphs over the Reals, Caribbean J. Math. Comput. Sci. 1 (1991) 1-4
  • [11] M. Ellingham, Sum Graphs from Trees. Ars Combinatoria, 35 (1993) 335-349.
  • [12] F. Harary, Graph Theory, Adision – Wesley, Reading Mass, 1969.
  • [13] S. Murugesan, D. Jayaraman and J. Shiama. Centered triangular sum labeling of graphs, International Journal of Applied Information Systems, 5(7) (2013) 1-4
  • [14] P. Jeyanthi, R. Kalaiyarasi and D. Ramya, Centered Triangular Mean Graphs. International J. Math. Combin. Vol. 1 (2019) 126-133
  • [15] M. Basker, P. Namasivayam, M. P. Syed Ali Nisaya. Some Results on Centered Triangular Sum Graphs. World Scientific News 155 (2021) 113-128
  • [16] D. S. T. Ramesh and M. P. Syed Ali Nisaya, Some Important Results on Pentagonal Graceful Graphs. International Journal of Applied Mathematical Sciences, 7(1), (2014), 71-77
  • [17] M. P. Syed Ali Nisaya and D. S. T. Ramesh, Pentagonal graceful labeling of Caterpillar Graphs. International Journal of Engineering Devlopment and Research 6(4) (2018) 150-154
  • [18] D. S. T. Ramesh and M. P. Syed Ali Nisaya, Some More Polygonal Graceful Labeling of Path. International Journal of Imaging Science and Engineering, 6(1), (2014), 901-905
  • [19] M. Vanu Esakki, M. P. Syed Ali Nisaya. Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
  • [20] M. Vanu Esakki, M. P. Syed Ali Nisaya. Some Results on Two Modulo Three Sum Graphs. Journal of Xidian University, 14(9) (2020) 1090-1099
  • [21] K. Kovusalya and P. Namasivayam, Some Results on Octagonal Graceful Graphs. World Scientific News 156 (2021) 1-12
  • [22] Frank Werner, Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [23] P. Lalitha, M. Gayathri, L. Tamilselvi and A.V. Arun. Application of Graceful Labeling in Dental Arch. Drug Innovation Today, Vol. 11, Issue 3, (2019) 637-638
  • [24] V. Lavanya, D.S.T. Ramesh and N. Meena, Bi-Domination in Corona Related Graphs. Journal of Computer and Mathematical Sciences, Vol. 10 (11), November (2019), 1650-1653
  • [25] S. Mahendran and K. Murugan. Pentagonal Graceful Labeling of Some Graphs. World Scientific News 155 (2021) 98-112
  • [26] Monika K, Murugan K. Fibonacci Sum Labeling of Tree Related Graphs. Adalya Journal, Vol. 8, Issue 9, (2019) 320-323. DOI:16.10089.AJ.2019.V8I9.285311.6154
  • [27] Muhammed Imran, Adnan Aslam, Sohail Zafar and Waqar Nazeer, Further Results on Edge Irregularity Strength of Graphs. Idonesian Journal of Combinnatorics 1(2), (2017) 82-97
  • [28] G. Muppidathi Sundari & K. Murugan, Extra Skolem Difference Mean Labeling of Some Graphs. World Scientific News 145 (2020) 210-221
  • [29] K. Murugan and A. Subramanian, Labeling of Subdivided Graphs. American Journal of Mathematics and Sciences Vol. 1, No. 1, January (2012), 143-149
  • [30] K. Murugan and A. Subramanian, Skolem Difference Mean Graphs. Mapana J Sci 11, 4, (2012) 109-120
  • [31] K. Murugan, Square Graceful Labeling of Some Graphs. International Journal of Innovative Research in Science, Engineering and Technology, Vol. 4, Issue 2, (2015) 511-520
  • [32] R. Sivaraman, Graceful Graphs and its Applications. International Journal of Current Research, Vol. 8, Issue 11, (November 2016) 41062-41067
  • [33] K. Thajeswari, S. Kirupa. Application of Graceful Graph in MPLS. International Journal for Scientific Research and Development, Vol. 6, Issue 06, (2018) 196-198
  • [34] T. Tharmaraj, P. B. Sarasija, Square Graceful Graphs. International Journal of Mathematics and Soft Computing, Vol. 4, No. 1, (2014) 129-137
  • [35] N. Vedavathi, Dharmaiya Gurram, Applications on Graph Theory. International Journal of Engineering Research and Technology, Vol. 2, Issue 1, (2013) 1-4
  • [36] P. Gnanachandra, M. Lellis Thivagar, Separation axioms by virtue of soft semi*-open sets. World Scientific News 145 (2020) 74-84
  • [37] Kostochka, Alexandr, Yager, Derrek, Yu, Gexin 2020. Disjoint Chorded Cycles in Graphs with High Ore-Degree. Discrete Mathematics and Applications Vol. 165, p. 259. https://doi.org/10.1007/978-3-030-55857-4_11
  • [38] Costalonga, J.P., Kingan, Robert J., Kingan, Sandra R. 2021. Constructing Minimally 3-Connected Graphs. Algorithms, Vol. 14, Issue. 1, p. 9. https://doi.org/10.3390/a14010009
  • [39] G. Muthumanickavel, K. Murugan, Oblong Sum Labeling of Union of Some Graphs. World Scientific News 145 (2020) 85-94
  • [40] N. Vedavathi, Dharmaiya Gurram, Applications on Graph Theory. International Journal of Engineering Research and Technology, Vol. 2, Issue 1, (2013) 1-4
  • [41] N. Meena, M. Madhan Vignesh. Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News 145 (2020) 234-244
  • [42] Frank Werner.Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [43] Xiaojing Yang, Junfeng Du, Liming Xiong. Forbidden subgraphs for supereulerian and Hamiltoniangraphs. Discrete Applied Mathematics Volume 288, 15 January 2021, Pages 192-200. https://doi.org/10.1016/j.dam.2020.08.034
  • [44] M. Prema and K. Murugan, Oblong sum labeling of some graphs. World Scientific News 98 (2018) 12-22
  • [45] Chiba, Shuya, Yamashita, Tomoki, 2018. Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey. Graphs and Combinatorics, Vol. 34, Issue. 1, p. 1. https://doi.org/10.1007/s00373-017-1873-5
  • [46] Molla, Theodore, Santana, Michael, Yeager, Elyse 2020. Disjoint cycles and chorded cycles in a graph with given minimum degree. Discrete Mathematics, Vol. 343, Issue. 6, p. 111837. https://doi.org/10.1016/j.disc.2020.111837
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-b9c243bb-12b9-43af-8aa1-6b53fb6e9793
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.