Felicitous Labelings of Some Graphs
Journal: Academic Journal of Applied Mathematical Sciences (Vol.2, No. 8)Publication Date: 2016-08-15
Authors : V. Lakshmi Alias Gomathi;
Page : 93-97
Keywords : Graph; Labeling; Felicitous labeling; Path; Cycle; Linear cactus; Bigraph; Splitting graph; Planar graph.;
Abstract
A felicitous labeling of a graph G, with q edges is an injection f : V(G) → {0, 1, 2,. . . , q} so that the induced edge labels f *(xy) = (f(x) + f(y)) (mod q) are distinct.
Other Latest Articles
- On Nonlocal Initial Problems for Fuzzy Differential Equations and Environmental Pollution Problems
- Инновационный подход к проектированию тканей комбинированных переплетений с длинными прокидками
- Pure Moving Average Vector Bilinear Time Series Model and Its Application
- Spectra of Graphs with End Vertices Appended to All Vertices of the Base Graph: The Golden Ratio and Energy
- The Relationship between GDP and Co2 Emission in Nigeria Using the Least Square Polynomials
Last modified: 2018-11-02 16:24:51