k?Super Root Square Mean Labeling of Some Graphs
Journal: International Journal of Science and Research (IJSR) (Vol.6, No. 2)Publication Date: 2017-02-05
Authors : Akilandeswari. K;
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;
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.
Other Latest Articles
- Knowledge, Attitude&Practice Regarding Dengue Fever among Secondary School Students in Jeddah City during the Year 2014-2015
- STD Awareness among Male in Ahsa
- A Statistical Study of Anxiety among College Students: A Case Study in Chennai City
- An Attempt to Compile a Dictionary of Equivalent Hindi Words from English in the Field of Physical Education and Sports
- Actinic Cheilitis: Literature Data and Case Report
Last modified: 2021-06-30 17:48:27