Total Edge Fibonacci-Like Sequence Irregular Labeling
S. Karthikeyan, R. Sridevi, S. Navanaeethakrishnan · International Journal of Mathematics and Soft Computing · 2014
In this paper, we define total edge Fibonacci- like sequence irregular labeling f: V (G) E(G) → {1, 2,...,K} of a graph G = (V,E) of vertices and edges of G in such a way that for any two different edges xy and x′y ′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct Fibonacci-like sequence numbers. The total edge Fibonacci- like sequence irregular-ity strength, tefls(G) is defined as the minimum K for which G has a total edge Fibonacci- like sequence irregular labeling. A graph that admits a total edge Fibonacci- like sequence irregular labeling is called a total edge Fibonacci- like sequence irregular graph. In this paper, we prove Pn and Cn and Book (with 3 and 4 sides) are total edge Fibonacci- like sequence irregular graphs.