University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 9 1 2018 03 01 On Common Neighborhood Graphs II 37 46 55313 10.22052/ijmc.2017.53463.1195 EN A. Hamzeh Tarbiat Modares University A. Iranmanesh Tarbiat Modares University S. Hossein-Zadeh Tarbiat Modares University M. A. Hosseinzadeh Tarbiat Modares University I. Gutman University of Kragujevac Journal Article 2016 05 03 Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(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. Common neighborhood graph congraph Mycielski graph shadow graph Haj´os join https://ijmc.kashanu.ac.ir/article_55313_8c66633a3d6bc9e712ed2dae39f03636.pdf