TY - JOUR
T1 - The Common Neighborhood Graph and Its Energy
TT -
JF - IJMSI
JO - IJMSI
VL - 7
IS - 2
UR - http://ijmsi.ir/article-1-349-en.html
Y1 - 2012
SP - 1
EP - 8
KW - Common neighborhood graph
KW - Congraph
KW - Spectrum (of graph)
KW - Energy (of graph).
N2 - 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.
M3 10.7508/ijmsi.2012.02.001
ER -