On the Independent Neighborhood Polynomial of the Rooted Product of Two Trees
Keywords:Rooted Graph, Rooted Product of Graphs, Independent Neighborhood Polynomial
Let G be a connected graph. We say that a given graph is a tree if every pair of
vertices 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.
How to Cite
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.