Cardinal labeling of H-graphs
Abstract
Let G (V,E) be a simple connected undirected graph. Let |V|=p, |E|=q and let C = { 1,2..., p+q}. G is said to admit cardinal labeling if the one-to-one function f from the vertex set V into the set C generates a one-to-one edge function f* onto the set C\f (V) defined by |f(u)-f(v)|= f*(uv) ∀ uv ∈ E. A graph G is said to be cardinal if it admits cardinal labeling. In this paper we have discussed cardinal labeling for H- graph H_n, subdivided H-graph S(H_n), corona of H-graphH_n ⨀▒K_1 ,H_n ⨀▒〖mK〗_1 and H-cracker graphH_(n,k).
References
[2] M. Kannan, R. Vikrama Prasad and R. Gopi, Even Vertex Odd Mean Labeling of H-graph, International Journal of Mathematical Archive, Volume 8, Issue 8 (2017) pp. 162-167.
[3] R. Ponraj, S. Subbulakshmi and S. Somasundaram, 4-Total Mean Cordial Labeling of Some Graphs Derived from H-Graph and Star, International Journal of Mathematical Combinatorics, Volume 3 (2022), pp. 99-106.
[4] A. Sugumaran and V. Mohan, Prime Cordial Labeling of Some Graphs Related to H-Graph, Annals of Pure and Applied Mathematics, Volume 16, No. 1 (2018), pp. 171-176.
[5] R. Vasuki, P. Sugirtha and J. Venkateshwari, Super Mean Labeling of some Subdivision Graphs, Kragujevac Journal of Mathematics, Volume 41 (2) (2017), pp. 179-201.