Research Article | Open Access | Download PDF
Volume 62 | Number 2 | Year 2018 | Article Id. IJMTT-V62P515 | DOI : https://doi.org/10.14445/22315373/IJMTT-V62P515
Skolem Difference Lucas Mean Labeling for Star Related Graphs
A.Ponmoni, S.Navaneetha Krishnan and A.Nagarajan
Citation :
A.Ponmoni, S.Navaneetha Krishnan and A.Nagarajan, "Skolem Difference Lucas Mean Labeling for Star Related Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 62, no. 2, pp. 104-109, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V62P515
Abstract
A graph ๐บ with ๐ vertices and ๐ edges is said to have Skolem difference Lucas mean labeling if it is
possible to label the vertices ๐ฅ โ ๐ฃ with distinct elements ๐(๐ฅ) from the set 1,2, โฆ , ๐ฟ๐+๐
in such a way that the
edge ๐ = ๐ข๐ฃis labelled with
๐ ๐ข โ๐(๐ฃ)
2
if ๐ ๐ข โ ๐(๐ฃ) is even and ๐ ๐ข โ๐(๐ฃ +1
2
if ๐ ๐ข โ ๐(๐ฃ) is odd, then
the resulting edge labels are distinct and are from ๐ฟ1
, ๐ฟ2
, โฆ , ๐ฟ๐
.A graph that admits Skolem difference Lucas
mean labelling is called a Skolem difference Lucas mean graph. In this paper, we proved for some star related
graphs such as ๐พ1,๐
+ , ๐พ1,๐ โ ๐พ1,๐
, ๐พ1,๐ โ 2๐๐
, ๐ต๐,๐
, < ๐พ1,๐
(1)
,๐พ1,๐
(2)
,๐พ1,๐
(3)
, โฆ ,๐พ1,๐
(๐) > , are Skolem difference
Lucas mean graph.
Keywords
Skolem Mean Labeling, Skolem difference Mean Labeling , Skolem difference Lucas Mean Labeling.
References
[1] V.Balaji , D.S.T.Ramesh , A, Subramanian , Skolem Mean Labeling ; Bulletin of Pure and Applied Sciences , Vol.26E(2)(2007),245-248.
[2] L.W. Beineke and S.M. Hedge, Strongly Multiplicative graphs, Discuss. Math. Graph Theory, vol. 21, 63-75, and 2001.
[3] J.A. Gallian, A Dynamic survey of graph labeling, The electronic Journal of combinatorics, 16(2009), #DS6, pp 219.
[4] Frank Harary, Graph theory, Narosa publishing house pvt.Ltd. 10th reprint, 2001.
[5] K. Murugan, A. Subramanian, Skolem difference mean Labeling of H-graphs , International Journal of Mathematics and Soft Computing, Vol, No.1(2011),115-129.