(k, d)-Super Root Square Mean Labeling

Akilandeswari. K

Abstract: 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.

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

How to Cite?: Akilandeswari. K, "(k, d)-Super Root Square Mean Labeling", Volume 6 Issue 2, February 2017, International Journal of Science and Research (IJSR), Pages: 1608-1610, https://www.ijsr.net/getabstract.php?paperid=ART20171065, DOI: https://dx.doi.org/10.21275/ART20171065

Download Citation: APA | MLA | BibTeX | EndNote | RefMan