2-Divisor Lucky Labeling of some Identity Graphs of Finite Group and some Zero-Divisor Graphs

A graph be a graph with n vertices and m edges. A graph G admits 2-divisor luckylabeling if be a labeling of vertices of graph G from {1,2,3,…,n}. Definewhere N(v) is the neighborhood of v such that s(u) ≠ s(v) for every pair ofadjacent vertices u and v in G. The vertex 2-divisor lucky number is the least number from theset {1,2,…,n} that has been used to label the graph G. It is denoted by In this paper wehave investigated for some types of identity graphs of finite group and some zero-divisor graphs