International Journal of Statistics and Applied Mathematics
  • Printed Journal
  • Indexed Journal
  • Refereed Journal
  • Peer Reviewed Journal

International Journal of Statistics and Applied Mathematics

2018, Vol. 3, Issue 2, Part B

On duplication of near Skolem difference mean graph Pn


Author(s): S Shenbaga Devi and A Nagarajan

Abstract: Let G be a (p,q) graph and f:V(G)→{1,2,…,p+q-1,p+q+2} be an injection. For each edge e=uv, the induced edge labeling f^* is defined as follows:
3-1-44
Then f is called Near Skolem difference mean labeling if f^* (e) are all distinct and from {1,2,3,….q}. A graph that admits a Near Skolem difference mean labeling is called a Near Skolem difference mean graph. In this paper, we show that the graph obtained by duplicating a vertex or an edge in a Near Skolem Difference Mean graph P_n is also a Near skolem difference mean graph.


Pages: 93-100 | Views: 197 | Downloads: 13

Download Full Article: Click Here
How to cite this article:
S Shenbaga Devi, A Nagarajan. On duplication of near Skolem difference mean graph Pn. Int J Stat Appl Math 2018;3(2):93-100.
Call for book chapter
International Journal of Statistics and Applied Mathematics