PL EN


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

Second order triangular graceful graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
Let G=(V,E) be a graph with p vertices and q edges. A second order triangular graceful labeling of a graph G is an one to one function φ:V(G)→{0,1,2,…,B_q} where B_q is the qth second order triangular number, ie., B_q=1/6 q(q+1)(2q+1), that induces a bijection φ^*:E(G)→{B_1,B_2,…,B_q} of the edges of G defined by φ^* (uv) =|φ(u)-φ(v)| ∀ e=uv ∈E(G). A graph which admits such labeling is called a second order triangular graceful graph. In this paper, we introduce second order triangular graceful labeling and we prove that star, subdivision of star, nK_1,3, nK_2, bistar, path, comb, coconut tree, shrub and Y-tree are second order triangular graceful graphs.
Year
Volume
155
Pages
140-154
Physical description
Contributors
  • 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
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] M. Apostal, Introduction to Analytic Number Theory, Narosa Publishing House, Second Edition, 1991.
  • [3] M. Basker, P. Namasivayam, M. P. Syed Ali Nisaya. Some Results on Centered Triangular Sum Graphs. World Scientific News 155 (2021) 113-128
  • [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, (1978), 53-65.
  • [5] David M. Burton, Elementary Number Theory, Second Edition, Wm. C. Brown Company Publishers, 1980.
  • [6] J. A. Gallian. A Dynamic survey of Graph labeling. The Electronic Journal of Combinatorics, 22 (2019), #DS6
  • [7] S. W. Golomb, How to Number a Graph, Graph Theory and Computing, R. C. Read, Academic Press, New York (1972), 23-37
  • [8] F. Harary, Graph Theory, Adision - Wesley, Reading Mass, 1969.
  • [9] S. Mahendran, K. Murugan. Pentagonal Graceful Labeling of Some Graphs. World Scientific News 155 (2021) 98-112
  • [10] K. Murugan. Square graceful labeling of Some Graphs. International Journal of Innovative Research in Science, Engineering and Technology 4(2) (2015) 511-520
  • [11] S. Murugesan, D. Jayaraman, J. Shiama. Some Higher Order Triangular Sum Labeling of Graphs. International Journal of Computer Applications, 72(10) (2013) 1-8
  • [12] G. Muthumanickavel, K. Murugan, Oblong Sum Labeling of Union of Some Graphs. World Scientific News 145 (2020) 85-94
  • [13] I. Niven and Herbert S. Zuckerman. An Introduction to the Theory of Numbers. Wiley Eastern Limited, Third Edition, 1991
  • [14] K. R. Parthasarathy. Basic Graph Theory. Tata Mcgraw Hill Publishing Company Limited, 1994
  • [15] 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
  • [16] 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
  • [17] A. Rosa, On Certain Valuations of the Vertices of a Graph, Theory of Graphs (Proc. International Symposium, Rome, 1966), Gordon and Breach, N. Y and Dunad Paris (1967), 349-355
  • [18] R. Sivaraman, Graceful Graphs and its Applications. International Journal of Current Research, 8(11) (2016) 41062-41067
  • [19] 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
  • [20] T. Tharmaraj and P. B. Sarasija. Square graceful graphs. International Journal of Mathematics and Soft Computing, Vol. 4, No. 1, (2014) 129-137
  • [21] T. Tharmaraj and P. B. Sarasija, Some Square graceful Graphs. International Journal of Mathematics and Soft Computing, Vol. 5, No. 1, (2015) 119-127
  • [22] M. Vanu Esakki, M. P. Syed Ali Nisaya. Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
  • [23] 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
  • [24] N.Vedavathi, Dharmaiya Gurram, Applications on Graph Theory. International Journal of Engineering Research and Technology, Vol. 2, Issue 1, (2013) 1-4
  • [25] G. Muppidathi Sundari & K. Murugan. Extra Skolem Difference Mean Labeling of Some Graphs. World Scientific News 145 (2020) 210-221
  • [26] N. Meena, M. Madhan Vignesh. Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News 145 (2020) 234-244
  • [27] Frank Werner. Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [28] 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
  • [29] 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
  • [30] 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
  • [31] 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
  • [32] 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-70b05ea0-1b84-4b85-bbff-8f328e105f89
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.