Let G be a (p, q) graph and define an injective function f : V (G) → {1, 2, 3…p+q} . Now for suppose for each edge we assign the labels such that E(G) → {1, 2, 3…p+q} the induced edge is even and is odd then f is called super mean labelling of graph. In this paper we wish to study the super mean labelling of some of digital alphabets C,G,L,M,N,S,V,W and extend the study towards the M-Joins of digital alphabets C,G,L,M,N,S,V,W and study some characteristics property related to them.
REFERENCES
1.
2.
3.
D.
Ramya
, R.
Ponraj
and P.
Jeyanthi
, Super mean labelling of graphs, Ars Combin
, 112
(2013
), 65
–72
4.
R.
Vasuki
, P.A.
Sugirtha
and J.
Venkeswari
, Super Mean Labeling of Subdivision Graphs
, Kragujevac Journal of Mathematics
, Volume 41
(2
) (2017
) pp. 179
–201
5.
S.
Sriram
, R.
Govindarajan
, Harmonic Mean Labeling of Joins of Square of Path Graph
International Journal of Research in Advent Technology
, Volume. 7
, No. 3
. March. 2019
.6.
S.
Sriram
, R.
Govindarajan
, K.
Thirusangu
, Pell Labeling of Joins of Square of Path Graph
, International Journal of Engineering and Advanced Technology(IJEAT)
, ISSN , Volume-9
, Issue-IS3
, December 2019
This content is only available via PDF.
© 2020 Author(s).
2020
Author(s)
You do not currently have access to this content.