EDGE IDENTIFYING CODE NUMBER OF STARLIKE TREES

Let G = (V,E) be a simple graph. A set CE of edges of G is an edge identifying code of G if for every two edges e and e' the sets NG[e] CE and NG[e'] CE are non-empty and different. Given a graph G the smallest size of an edge identifying code of G is called the edge identifying code number of G and is denoted by EID (G). In this paper, we consider the edge identifying code number of some graphs. Also, we prove that the edge identifying code number of the Starlike tree St(l۱, l۲, ..., lr), is (l۱+۱)r ۳ ≤ l₁ = lr = ۲k + ۱. Key words and phrases. Edge identifying code, Edge identifying code number, Starlike tree.

کلیدواژه ها:

Edge identifying code ، Edge identifying code number ، Starlike tree