@article {
author = {Hamzeh, A. and Iranmanesh, A. and Hossein-Zadeh, S. and Hosseinzadeh, M. and Gutman, I.},
title = {On common neighborhood graphs II},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {9},
number = {1},
pages = {37-46},
year = {2018},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.53463.1195},
abstract = {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.},
keywords = {Common neighborhood graph,congraph,Mycielski graph,shadow graph,HajĀ“os join},
url = {http://ijmc.kashanu.ac.ir/article_55313.html},
eprint = {http://ijmc.kashanu.ac.ir/article_55313_8c66633a3d6bc9e712ed2dae39f03636.pdf}
}