On the Independent Neighborhood Polynomial of the Rooted Product of Two Trees

Let G be a connected graph. We say that a given graph is a tree if every pair ofvertices is connected by a unique path. The rooted product of two trees is relevant to tree, as the obtained product is another tree. In this paper, we establish the independent neighborhood sets of a tree and obtain its corresponding independent neighborhood polynomial. Furthermore, the independent neighborhood polynomial of the rooted product of two trees were determine using their independent neighborhood sets.