@ARTICLE{Alwardi,
author = {Alwardi, Anwar and Arsic, Branko and Gutman, Ivan and Soner, Nandappa D. and },
title = {The Common Neighborhood Graph and Its Energy},
volume = {7},
number = {2},
abstract ={Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established. },
URL = {http://ijmsi.ir/article-1-349-en.html},
eprint = {http://ijmsi.ir/article-1-349-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {10.7508/ijmsi.2012.02.001},
year = {2012}
}