%0 Journal Article
%A Alwardi, Anwar
%A Arsic, Branko
%A Gutman, Ivan
%A Soner, Nandappa D.
%T The Common Neighborhood Graph and Its Energy
%J Iranian Journal of Mathematical Sciences and Informatics
%V 7
%N 2
%U http://ijmsi.ir/article-1-349-en.html
%R 10.7508/ijmsi.2012.02.001
%D 2012
%K Common neighborhood graph, Congraph, Spectrum (of graph), Energy (of graph).,
%X 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.
%> http://ijmsi.ir/article-1-349-en.pdf
%P 1-8
%& 1
%!
%9 Research paper
%L A-10-1-112
%+
%G eng
%@ 1735-4463
%[ 2012