Abstract:
In this paper, we consider the total network interactions of graphs. This interaction connects every vertex of one graph to every vertex of another graph. After characterizing the cliques in the resulting graph, we established the clique neighborhood polynomial.