PL EN


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

Some Special Results for Square Pyramidal Graceful Graphs

Authors
Content
Title variants
Languages of publication
EN
Abstracts
EN
Numbers of the form (n(n+1)(2n+1))/6 for all n≥1 are called square pyramidal numbers. Let G be a graph with p vertices and q edges. Let τ : V(G) →{0, 1, 2… M_k} where M_k is the k^th square pyramidal number be an injective function. Define the function τ*:E(G)→{1,5,14,.., M_k} such that τ *(uv) = |τ (u)- τ (v)| for all edges uvϵE(G). If τ *(E(G)) is a sequence of distinct consecutive square pyramidal numbers {M_1,M_2, …, M_k}, then the function τ is said to be square pyramidal graceful labeling and the graph which admits such a labeling is called a square pyramidal graceful graph. In this paper, some special results for square pyramidal graceful graphs is studied.
Year
Volume
156
Pages
147-160
Physical description
Contributors
author
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
References
  • [1] M. Apostal. Introduction to Analytic Number Theory, Narosa Publishing House, Second Edition, 1991.
  • [2] I. Niven and Herbert S. Zuckerman. An Introduction to the Theory of Numbers, Wiley Eastern Limited, Third Edition, 1991.
  • [3] K. R. Parthasarathy. Basic Graph Theory. Tata Mcgraw Hill Publishing Company Limited, 1994.
  • [4] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan Press, London, 1976.
  • [5] A. Rosa, On Certain Valuations of the Vertices of a Graph, Theory of Graphs (Proc. Internat. Symposium, Rome, 1966), Gordon and Breach, N. Y and Dunad Paris (1967), 349-355
  • [6] S. W. Golomb, How to Number a Graph, Graph Theory and Computing, R. C. Read, Academic Press, New York (1972), 23-37.
  • [7] B. D. Acharya, Construction of Certain Infinite Families of Graceful Graphs from a shown graceful graph. Def. Sci. J. 32(3) (1982) 231-236
  • [8] Joseph A Gallian. A Dynamic Survey of Graph labeling. The Electronic Journal of Combinatorics, 15, 2008, #DS6
  • [9] K. Kovusalya and P. Namasivayam, Some Results on Octagonal Graceful Graphs. World Scientific News 156 (2021) 1-12
  • [10] Frank Werner, Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [11] 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
  • [12] 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
  • [13] S. Mahendran and K. Murugan. Pentagonal Graceful Labeling of Some Graphs. World Scientific News 155 (2021) 98-112
  • [14] Monika K, Murugan K. Fuibonacci Sum Labeling of Tree Related Graphs. Adalya Journal, Vol. 8, Issue 9, September (2019) 320-323
  • [15] 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
  • [16] G. MuppidathiSundari& K. Murugan, Extra Skolem Difference Mean Labeling of Some Graphs. World Scientific News 145 (2020) 210-221
  • [17] K. Murugan and A. Subramanian, Labeling of Subdivided Graphs. American Journal of Mathematics and Sciences Vol. 1, No. 1, January (2012), 143-149
  • [18] K. Murugan and A. Subramanian, Skolem Difference Mean Graphs. Mapana J Sci 11, 4, (2012) 109-120
  • [19] 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
  • [20] D.S.T. Ramesh and M.P. Syed Ali Nisaya, Some Important Results on Pentagonal Graceful Graphs. International Journal of Applied Mathematical Sciences, Vol. 7, Issue 1, (2014) 71-77
  • [21] R. Sivaraman, Graceful Graphs and its Applications. International Journal of Current Research, Vol. 8, Issue 11, (November 2016) 41062-41067
  • [22] M.P. Syed Ali Nisaya and D.S.T. Ramesh, Pentagonal Graceful Labeling of Caterpillar Graphs. International Journal of Engineering Development and Research, Vol. 6, Issue 4 (2018) 150-154
  • [23] K. Thajeswari, S. Kirupa. Application of Graceful Graph in MPLS. International Journal for Scientific Research and Development, Vol. 6, Issue 06, (2018) 196-198
  • [24] T. Tharmaraj, P. B. Sarasija, Square Graceful Graphs. International Journal of Mathematics and Soft Computing, Vol. 4, No. 1, (2014) 129-137
  • [25] N. Vedavathi, Dharmaiya Gurram, Applications on Graph Theory. International Journal of Engineering Research and Technology, Vol. 2, Issue 1, (2013) 1-4
  • [26] P. Gnanachandra, M. Lellis Thivagar, Separation axioms by virtue of soft semi*-open sets. World Scientific News 145 (2020) 74-84
  • [27] R. Sakthi Sankari and M. P. Syed Ali Nisaya, Seond Order Triangular Gracful Graphs. World Scientific News 155 (2021) 140-154
  • [28] M. Basker, P. Namasivayam, M. P. Syed Ali Nisaya. Some Results on Centered Triangular Sum Graphs. World Scientific News 155 (2021) 113-128
  • [29] J. A. Gallian. A Dynamic survey of Graph labeling. The Electronic Journal of Combinatorics, 22 (2019), #DS6
  • [30] 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
  • [31] 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
  • [32] G. Muthumanickavel, K. Murugan, Oblong Sum Labeling of Union of Some Graphs. World Scientific News 145 (2020) 85-94
  • [33] K. R. Parthasarathy, Basic Graph Theory, Tata Mcgraw Hill Publishing Company Limited, 1994
  • [34] M. Vanu Esakki, M. P. Syed Ali Nisaya, Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
  • [35] 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
  • [36] N.Vedavathi, Dharmaiya Gurram, Applications on Graph Theory. International Journal of Engineering Research and Technology, Vol. 2, Issue 1, (2013) 1-4
  • [37] N. Meena, M. Madhan Vignesh. Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News 145 (2020) 234-244
  • [38] Frank Werner.Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [39] 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
  • [40] A. Fathima Banu, S. Chelliah, M. P. Syed Ali Nisaya, Even Vertex Tetrahedral Mean Graphs. World Scientific News 156 (2021) 26-39
  • [41] R. Sakthi Sankari, M. P. Syed Ali Nisaya, Higher order triangular graceful labeling of some graphs. World Scientific News 156 (2021) 40-61
  • [42] M. Baskar, P. Namasivayam, M. P. Syed Ali Nisaya, Further results on centered triangular sum graphs. World Scientific News 156 (2021) 13-25
  • [43] M. Prema and K. Murugan, Oblong sum labeling of some graphs. World Scientific News 98 (2018) 12-22
  • [44] 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
  • [45] 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-5fdc6dbf-dda0-40e6-9452-a345f5a9113d
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.