Total Mean Labeling Graphs
K. Karuppasamy1, S. Kaleeswari2
1Dr. K. Karuppasamy, Mathematics, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
2Mrs. S. Kaleeswari, Mathematics, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
Manuscript received on 07 January 2020 | Revised Manuscript received on 29 January 2020 | Manuscript Published on 04 February 2020 | PP: 90-92 | Volume-8 Issue-4S4 December 2019 | Retrieval Number: D10361284S419/2019©BEIESP | DOI: 10.35940/ijrte.D1036.1284S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let G=(V, E) be a finite, undirected simple graph with p vertices and q edges. A total mean labeling of G is a bijection f from V(G)E(G) to {1,2,…,p+q} such that for each edge 3 ( ) ( ) ( ) ( ), *( ) f u f v f uv uv E G f uv is distinct. A graph which admits a total mean labeling is called a total mean labeling graph. In this paper, we prove that , , , , Pn Pn K1,n K2,n , , Cn Bm,n Triangular snakes and Alternate Triangular snakes are total mean labeling graphs.
Keywords: Labeling, Mean Labeling, Total Mean Labeling.
Scope of the Article: Cryptography and Applied Mathematics