|
On felicitous labelings of P_{r,2m+1}, P_r^{2m+1} and C_nXP_mKeywords: Labeling , felicitous labeling Abstract: 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.
|