PL EN


Preferences help
enabled [disable] Abstract
Number of results
2021 | 155 | 98-112
Article title

Pentagonal Graceful Labeling of Some Graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
Numbers of the form (n(3n-1))/2 for all n ≥ 1 are called pentagonal numbers. Let G be a graph with p vertices and q edges. Let f : V(G)→{0,1,2,…,P_q} where P_q is the q^th pentagonal number be an injective function. Define the function f *: E(G) → {1,5,…,P_q} such that f *(uv)=│f(u)-f(v)│for all edges uv∈E(G). If f *( E(G)) is a sequence of distinct consecutive pentagonal numbers {P_1,P_2,…,P_q}, then the function f is said to be pentagonal graceful labeling and the graph which admits such a labeling is called a pentagonal graceful graph. In this paper, pentagonal graceful labeling of some graphs is studied.
Year
Volume
155
Pages
98-112
Physical description
Contributors
author
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, India
author
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, India
References
  • [1] B. D. Acharya, Construction of certain infinite families of graceful graphs from a given graceful graph. Def. Sci. J. 32(3) (1982) 231-236
  • [2] J.C. Berbond, Graceful Graphs, Radio Antennae and French Wind Mills. Graph Theory and Combinatories, Pitman, London, (1979), 13-17.
  • [3] G.S. Bloom and S.W. Golomb, Applications of Numbered Undirected Graphs. Proceedings of IEEE, Vol. 65, No. 4 (1977), 562-570
  • [4] Bloom G.S and Golomb S.W, Numbered Complete Graphs, Unusual Rules and Assoorted Applications, Theory and Application of Graphs, Lecture Notes in Math 642, Springer-Verlag, (1978), 53-65
  • [5] Frank Werner. Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [6] S.W. Golomb, How to Number a Graph in Graph theory and Computing, R.C. Read, Ed., Academic Press, New York (1972), 23-37.
  • [7] Joseph A Gallian, A Dynamic Survey of Graph labeling. The Electronic Journal of Combinatorics, 15, 2008, #DS6.
  • [8] D. Gunasekaran, K. Senbagam, R. Saranya, Labeling of 2-regular graphs by even edge magic. World Scientific News 135 (2019) 32-47
  • [9] 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
  • [10] Monika K, Murugan K, Fuibonacci Sum Labeling of Tree Related Graphs. Adalya Journal, Vol. 8, Issue 9, September (2019), 320-323
  • [11] Muhammed Imran, Adnan Aslam, Sohail Zafar and Waqar Nazeer, Further Results on Edge Irregularity Strength of Graphs, Indonesian Journal of Combinnatorics 1(2), (2017) 82-97
  • [12] G. Muppidathi Sundari & K. Murugan, Extra Skolem Difference Mean Labeling of Some Graphs. World Scientific News 145 (2020) 210-221
  • [13] K. Murugan and A. Subramanian, Labeling of Subdivided Graphs. American Jr. of Mathematics and Sciences, Vol. 1, No. 1, January (2012), 143-149
  • [14] K. Murugan and A. Subramanian, Skolem Difference Mean Graphs, Mapana J Sci 11, 4, (2012) 109-120
  • [15] K. Murugan, Square Graceful Labeling of Some Graphs, International Journal of Innovative Research in Science, Engineering and Technology, Vol. 4, Issue 2, February (2015) 511-520.
  • [16] 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.
  • [17] A. Rosa, On Certain Valuations of the Vertices of a Graph, Theory of Graphs, (International Symposium, Rome, July 1966), Gorden, Breach. N.Y. and Dunad, Paris (1967), 349-355
  • [18] R.Sivaraman, Graceful Graphs and its Applications, International Journal of Current Research, Vol. 8, Issue 11, (November 2016), 41062-41067.
  • [19] 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.
  • [20] G. Muthumanickavel, K. Murugan, Oblong Sum Labeling of Union of Some Graphs. World Scientific News, 145 (2020) 85-94
  • [21] N. Meena, M. Madhan Vignesh, Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News 145 (2020) 234-244
  • [22] M. Vanu Esakki, M. P. Syed Ali Nisaya, Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
  • [23] Xiaojing Yang, Junfeng Du, Liming Xiong. Forbidden subgraphs for supereulerian and Hamiltonian graphs. Discrete Applied Mathematics Volume 288, 15 January 2021, Pages 192-200. https://doi.org/10.1016/j.dam.2020.08.034
  • [24] 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
  • [25] 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
  • [26] Kostochka, Alexandr, Yager, Derrek, Yu, Gexin 2020. Discrete Mathematics and Applications. Vol. 165, p. 259. https://doi.org/10.1007/978-3-030-55857-4_11
  • [27] 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
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-2428c392-9550-49e7-989d-0a299040f58e
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.