Clique Neighborhood Polynomial of the Join of Graphs

An i-clique in G is a subset of V(G) which induces a complete subgraph of G of order i. In this paper, we examined the cardinality of the neighborhood systems of these cliques in a graph. Moreover, we established the clique neighborhood polynomial of the graph resulting from the join of two connected graphs.