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

(k, d)?Super Root Square Mean Labeling

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

Publication Date:

Authors : ;

Page : 1608-1610

Keywords : Super root square mean labeling; Super root square mean graph; k-Super root square mean labeling; k-Super root square mean graph; k; d -Super root square mean labeling; k; d -Super root square mean graph; path; comb; ladder and triangular snake;

Source : Downloadexternal Find it from : Google Scholarexternal


Let G be a (p, q) graph and fV (G) {k, k+d, k+2d, , k+d ( p+q-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, d) -Super root square mean labeling if f (V) {f^* (e) eE (G) }={k, k+d, k+2d, , k+d ( p+q-1) }. A graph that admits a (k, d) -Super root square mean labeling is called (k, d) -Super root square mean graph. In this paper, we investigate ( k, d) -Super root square mean labeling of some path related graphs.

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