S PETHANACHI SELVAM
@sfrcollege.edu.in
Associate Professor of Mathematics
The Standard Fireworks Rajaratnam College for Women, Sivakasi
EDUCATION
Doctorate in Mathematics in Semigraphs
RESEARCH INTERESTS
Graph Theory - Semigraphs, Labeling, Domination
Scopus Publications
Scholar Citations
Scholar h-index
Scopus Publications
J. Ashwini, S.Pethanachi Selvam, and R.B. Gnanajothi
College of Science for Women
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes while adding a graph G with Kn and deleting an edge e from Kn.
S. Padmashini and S. Pethanachi Selvam
Horizon Research Publishing Co., Ltd.