Super Cube Root Cube Mean Labeling of Graphs

Abstract

: A function f is called super cube root cube mean labeling of a graph G = (V,E) with p- vertices and q- edges if f: V(G) →{ 1, 2, . . ., p + q} is injective and the induced function f * defined as f * (uv) = 3 3 3 f(u) + f(v) 2       or 3 3 3 f(u) + f(v) 2       . For all uvE(G) is bijective. Then the resulting edge labels are distinct. A graph that admits a super cube root cube mean labeling f is called a super cube root cube means graph. In this paper we introduce super cube root cube mean labeling and investigate super cube root cube mean labeling of path Pn, Comb graph, ladder graph, pendant vertex attached with comb graph, pendant vertex attached with the ladder graph, CnK1, PnK3 and Fish graph.