Share Your Research, Maximize Your Social Impacts
On felicitous labelings of Pr,2m+1, P2m+1 r and Cn × Pm
Journal: International Journal of Mathematics and Soft Computing (Vol.3, No. 1)Publication Date: 2013-01-14
Authors : V. Lakshmi alias Gomathi A. Nagarajan A. Nellai Murugan;
Page : 97-105
Keywords : Labeling; felicitous labeling.;
Source : Download
Find it from : Google Scholar
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
Other Latest Articles
- Order six block integrator for the solution of first-order ordinary differential equations
- New self similar solution behind exponential magneto radiative blast wave in a dusty gas
- A novel watershed image segmentation technique using graceful labeling
- Graceful and odd graceful labeling of some graphs
- Certain conditions for norm-attainability of elementary operators and derivations
Last modified: 2013-08-24 11:54:02