On Felicitous Labelings of Pr,2m+1, Pr2m+1, Cn x Pm

Lakshmi Alias Gomathi, A Nagarajan, A Nellai Murugan


A simple graph G is called felicitous if there exists a one-to-one function f : V(G) ? {0,1,2, . . . , q} such that the set of induced edge labels f *(uv) = (f(u) + f(v)) (mod q) are all distinct. In this paper we show that Pr,2m+1, Pr2m+1 and Cn x Pm are felicitous graphs

Full Text:



. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Co., New York (1976).

. S.M. Lee, E.Schmeichel and S.C.Shee, On felicitous graphs, Discrete Math. 93 (1991), 201-209.

. J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, 6 (2001), # DS 6.

. R.Balakrishnan, A.Selvam and V.Yegnanarayanan, On Felicitous Labelings of Graphs, Proceedings of the National Workshop on Graph Theory and Its Applications, Manonmaniam Sundaranar University, Tirunelveli, Feb. 21-27, 1996, pp.47-61.

. K.M. Kathiresan, Two classes of Graceful Graphs, Ars Combin. 55 (2000), 129-132.

. K.M. Kathiresan and R.Ganesan, A Labeling Problem on the plane graph Pa.b, Ars. Combin. 73 (2004), 143-151.

. K.M. Kathiresan and R.Ganesan, d- antimagic labeling of the plane graphs Pab, J. Combin. Comput., 52 (2005), 89-96.

. C.Sekar, Gracefulness of Pa,b, Ars. Combin., 72 (2004), 181-190.


  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.