Title of article :
On Common Neighborhood Graphs II
Author/Authors :
HAMZEH, ASMA Department of Mathematics - aculty of Mathematical Sciences -Tarbiat Modares University -Tehran , IRANMANESH, ALI Department of Mathematics - aculty of Mathematical Sciences -Tarbiat Modares University -Tehran , HOSSEIN−ZADEH, SAMANEH Department of Mathematics - aculty of Mathematical Sciences -Tarbiat Modares University -Tehran , HOSSEIN−ZADEH, MOHAMMAD ALI Department of Mathematics - aculty of Mathematical Sciences -Tarbiat Modares University -Tehran , GUTMAN, IVAN Faculty of Science - University of Kragujevac - P. O. Box 60, 34000 Kragujevac - Serbia
Abstract :
Let be a simple graph with vertex set V(G). The common
neighborhood graph or congraph of G, denoted by can (G), is a
graph with vertex set V(G), in which two vertices are adjacent
if and only if they have at least one common neighbor in G.
We compute the congraphs of some composite graphs. Using
these results, the congraphs of several special graphs are
determined.
Keywords :
Common neighborhood graph , Congraph , Mycielski graph , Shadow graph , Hajós join
Journal title :
Astroparticle Physics
