Abstract

Let G be a graph and{}qpGVf+→,,3,2,1)(: be an injection. For each ,uv the induced edge labeling *f is defined as()()()+=222*vfufuvf.Then f is called a super F-root square mean labeling if{}{}.,,3,2,1)(:)(*))((:qpGEuvuvfGVf+=∈∪ A graph that admits a super F-root square mean labeling is called a super F-root square mean graph. In this paper, we have studied the super F-root square meanness of various graphs obtained from paths. AMS 2010 Mathematics Subject Classification: 05C78.

Paper Details