Open AccessTotal Mean Labeling Graphs
Author(s) -
K. Karuppasamy,
Mrs Kaleeswari
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1036.1284s419
Subject(s) - combinatorics , bijection , simple graph , graph , mathematics , undirected graph , edge graceful labeling , graph labeling , graph power , line graph
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.