PL EN


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

Even Vertex Tetrahedral Mean Graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
The nth tetrahedral number is denoted by T_n and is of the form T_n = 1/6 n (n+1) (n+2). A graph G with p vertices and q edges is said to have an even vertex tetrahedral mean labeling if there exists an injective function f: V(G) →{0┤, 2, 4, . . . , 2T_q-2 , ├ 2T_q } such that the induced edge function f^*: E(G) →{T_1,T_(2 , . . .) ,T_q } defined by f^*(uv) = (f(u)+ f(v))/2 ∀ e=uv∈E(G) is a bijection. A graph which admits even vertex tetrahedral mean labeling is called an even vertex tetrahedral mean graph. In this paper, we introduce even vertex tetrahedral mean labeling and we prove that path, star, bistar, coconut tree, caterpillar, shrub, P_(m )@ P_n, banana tree, Y- tree and F-tree are even vertex tetrahedral mean graphs.
Year
Volume
156
Pages
26-39
Physical description
Contributors
  • 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
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
References
  • M. Apostal, Introduction to Analytic Number Theory, Narosa Publishing House, Second Edition, 1991.
  • S. Arockiaraj and B. S. Mahadevesaswamy, Even vertex odd mean labeling of graphs obtained from graph operations. International Journal of Advance Research in Edu. Tech. & Management 3(1) (2015) 192
  • David M. Burton, Elementary Number Theory, Second Edition, Wm. C. Brown Company Publishers, 1980.
  • J. A. Gallian. A Dynamic survey of Graph labeling. The Electronic Journal of Combinatorics, 22 (2019), #DS6
  • S. W. Golomb, How to Number a Graph, Graph Theory and Computing, R. C. Read, Academic Press, New York (1972), pp. 23-37
  • F. Harary, Graph Theory, Adision - Wesley, Reading Mass, 1969.
  • G. Muppidathi Sundari, K. Murugan. Extra Skolem Difference Mean Labeling of Some Graphs. World Scientific News 145 (2020) 210-221
  • K. Murugan, Square Graceful Graceful Labeling of Some Graphs. International Journal of Innovative Research in Science, Engineering and Technology, Vol. 4, Issue 2, (2015) 511-520
  • K. Murugan and A. Subramanian, Labeling of Subdivided Graphs. American Journal of Mathematics and Sciences, Vol. 1, No. 1, (2012) 143-149
  • K. Murugan and A. Subramanian, Skolem Difference Mean Graphs. Mapana J Sci 11, 4, (2012) 109-120
  • K. Murugan and A. Subramanian. Skolem difference mean labeling of H-graphs. International Journal of Mathematics and Soft Computing, Vol. 1, No. 1. (2011) 115-1529
  • K. Murugan and A. Subramanian, Labeling of finite union of paths. International Journal of Mathematics and Soft Computing Vol. 02, Issue 1, (2012) 99-108
  • I. Niven and Herbert S. Zuckerman. An Introduction to the Theory of Numbers, Wiley Eastern Limited, Third Edition, 1991.
  • G. Muthumanickavel, K. Murugan. Oblong Sum Labeling of Union of Some Graphs. World Scientific News 145 (2020) 85-94
  • 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.
  • 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), pp. 349-355.
  • R.Sivaraman, Graceful Graphs and its Applications, International Journal of Current Research, Vol. 8, Issue 11, (2016) 41062-41067
  • Somasundaram and Ponraj. Some Result on Mean Graphs. Pure and Applied Mathematics Sciences 58 (2003) 29-35
  • Somasundaram and Ponraj, Mean labeling of Graphs. National Academy Science Letters (26) (2003) 210-213
  • Sundaram M and Ponraj, Mean Number of a graphs. Pure and Applied Mathematics Science, Vol XV, No 1-2 (March 2007) 93-101
  • K.Thajeswari, S.Kirupa, Application of Graceful Graph in MPLS. International Journal for Scientific Research and Development, Vol. 6, Issue 06, (2018) 196-198
  • S. K. Vaidya and Lekha Bijukumar, Mean labeling in the context of some graph operations. International Journal of Algorithms, Computing and Mathematics, Vol.3, No. 1, (2010) 1-8.
  • Vasuki R and Nagarajan A, Meanness of the Graphs P_(a,b) and P_a^b. International Journal of Applied Mathematics 22(4) (2009) 663-675
  • Vasuki, A. Nagarajan and S. Arockiaraj, Even Vertex Odd Mean Labeling of Graphs. Sut J. Math 49(2) (2013) 79-92
  • Frank Werner. Graph Theoretic Problems and their New Applications. Mathematics, S 445 (2020) 1-4
  • M. Prema and K. Murugan, Oblong sum labeling of some graphs. World Scientific News 98 (2018) 12-22
  • M. Vanu Esakki and M. P. Syed Ali Nisaya. Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
  • Venkatesh Srinivasan, Natarajan Chidambaram, Narasimhan Devadoss, Rajadurai Pakkirisamy & Parameswari Krishnamoorthi (2020) On the gracefulness of m-super subdivision of graphs, Journal of Discrete Mathematical Sciences and Cryptography, 23:6, 1359-1368, DOI: 10.1080/09720529.2020.1830561
  • H. Yang, M.A. Rashid, S. Ahmad, M.K. Siddiqui, M. F. Hanif. Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs. Journal of Discrete Mathematical Sciences and Cryptography 22(7), 1165-1176, (2019). DOI: 10.1080/09720529.2019.1698800
  • L. Yan, Y. Li, X. Zhang, M. Saqlain, S. Zafar, M.R. Farahani. 3-total edge product cordial labeling of some new classes of graphs. Journal of Information & Optimization Sciences, 39(3) 2018, 705–724. DOI:10.1080/02522667.2017.1417727
  • X. Zhang, F.A.Shah, Y. Li, L.Yan, A.Q. Baig, M.R. Farahani. A family of fifth-order convergent methods for solving nonlinear equations using variational iteration technique. Journal of Information and Optimization Sciences, 39(3), 2018, 673–694. DOI:10.1080/02522667.2018.1443628
  • S. Mahendran and K. Murugan, Pentagonal Graceful Labeling of Some Graphs. World Scientific News 155 (2021) 98-112
  • R. Sakthi Sankari and M. P. Syed Ali Nisaya, Seond Order Triangular Gracful Graphs. World Scientific News 155 (2021) 140-154
  • N. Meena, M. Madhan Vignesh. Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News 145 (2020) 234-244
  • 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
  • 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
  • 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
  • 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
  • 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
  • Sullivan K, Rutherford D, Ulness DJ. Centered Polygonal Lacunary Graphs: A Graph Theoretic Approach to p-Sequences of Centered Polygonal Lacunary Functions. Mathematics 2019; 7(11): 1021. https://doi.org/10.3390/math7111021
  • M. Basker, P. Namasivayam, M. P. Syed Ali Nisaya. Some Results on Centered Triangular Sum Graphs. World Scientific News 155 (2021) 113-128
  • 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
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-630d2023-48dc-4c0c-8838-4de9460e9b68
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.