ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

k?Super Root Square Mean Labeling of Some Graphs

Journal: International Journal of Science and Research (IJSR) (Vol.6, No. 2)

Publication Date:

Authors : ;

Page : 1605-1607

Keywords : Super root square mean labeling; Super root square mean graph; k-Super root square mean labeling; k-Super root square mean graph; P_nK_1; 2; P_nK_1; 3; D T_n; Q_nK_1;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Let G be a (p, q) graph and fV (G) {k, k+1, k+2, , p+q+k-1} be an injection. For each edge e = uv, let f^* (e) = ( (f (u) ^2+f (v) ^2) /2) or ( (f (u) ^2+f (v) ^2) /2), then f is called k-Super root square mean labeling if f (V) {f^* (e) eE (G) }={k, k+1, k+2, , p+q+k-1}. A graph that admits a k-Super root square mean labeling is called k-Super root square mean graph. In this paper, we investigate k-Super root square mean labeling of some path related graphs.

Last modified: 2021-06-30 17:48:27