• ON FELICITOUS LABELINGS OF CYCLE RELATED GRAPHS

V. Lakshmi Alias Gomathi*, A. Nagarajan, A. Nellai Murugan

Abstract


A simple graph G is called felicitous if there exists a 1 – 1 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, cycle related graphs are shown to be felicitous.


Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter