Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a
graph with vertex set V , in which two vertices are adjacent if and only if they have a
common neighbor in G. In this paper, we obtain characteristics of congraphs under
graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product,
and Graph join, and relations between Cayley graphs and its c...
