Super Root Square Mean Labeling of Disconnected Graphs


Abstract views: 26 / PDF downloads: 45

Authors

  • M. Kannan Research & Development Centre, Bharathiar University, Coimbatore, Tamilnadu, India
  • R. Vikrama Prasad A.A.Government Arts College, Musiri, Trichy, Tamilnadu, India
  • R.Gopi Srimad Andavan Arts and Science College, T.V.Koil, Trichy, Tamilnadu, India

Keywords:

Super root square mean, $p_n\cup p_m$, $p_n\cup p_m^ $, $p_n^ \cup p_m^

Abstract

Let G be a graph with p vertices and q edges. Let $f:V(G)\to \{1, 2, 3,\dots, p+q\} be an injective function. For a vertex labeling f, the induced edge labeling $f^\ast(e=uv)$ is defined by then f is called a super root square mean if . A graph which admits super root square mean labeling is called super root square mean graph. In this paper, we investigate super root square mean labeling of disconnected graphs.

 

 

Author Biographies

M. Kannan, Research & Development Centre, Bharathiar University, Coimbatore, Tamilnadu, India

 

 

R. Vikrama Prasad, A.A.Government Arts College, Musiri, Trichy, Tamilnadu, India

 

 

R.Gopi, Srimad Andavan Arts and Science College, T.V.Koil, Trichy, Tamilnadu, India

 

 

Downloads

Published

29-02-2016

How to Cite

M. Kannan, R. Vikrama Prasad, & R.Gopi. (2016). Super Root Square Mean Labeling of Disconnected Graphs. International Journal of Mathematics And Its Applications, 4(1 - C), 93–98. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/600

Issue

Vol. 4 No. 1 - C (2016)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.