### Lucky Edge Neighborhood Labeling of Graphs

#### Abstract

Let G be a simple graph with vertex set V (G) and edge set E(G) respectively. Vertex set V (G) is labeled arbitrary by positive integers and E(G)

denote the edge label such that it is the sum of labels of vertices incident with

edge e. A lucky edge neighborhood labeling of G is assigning of positive integers

to the vertices of G so that each edge neighborhood labels are distinct.The least

integer for which a graph G has a lucky edge labeling from the set {1, 2, ..., k} is the lucky neighborhood number and is denoted by N(G).

The graph which admits lucky edge neighborhood labeling is called Lucky

edge neighborhood labeled graph. In this paper, we proved that Path, Cycle,

Tadpole, Subdivision of comb and Subdivision of crown are lucky edge neighborhood labeled graphs.

#### Full Text:

PDF#### References

J. A. Gallian, A Dynamic Survey of Graph Labeling. The Electronic Journal

of Combinatorics, 18, #DS6, 2011.

S.W.Golomb, How to number a graph. In: Graph Theory and Computing(R.

C. Read.Ed.) Academic Press, New York, 23 - 37.

Dr. A. Nellai Murugan, R. Maria Irudhaya Aspin Chitra,Lucky Edge Labeling

of Pn, Cn, Corona of Pn, Cn, IJSIMR, Volume 2, Issue 8, August 2014, pp.

-718.

A. Rosa, On Certain Valuations of the vertices of a Graph, In: Theory of

Graphs, (International Symposium, Rome, July 1966), Gordan and Breach,

N. Y. and Dunod Paris, 349 - 355.

### Refbacks

- There are currently no refbacks.

**IJMSC has been indexed in several world class data bases like Google Scholar , DOAJ(Directory of Open Access Journals), DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.**

## Comments on this article

by Mike Smith (2017-05-08)

by Mike Smith (2017-05-10)

by Mike Smith (2017-05-12)