RT - Journal Article
T1 - The Common Neighborhood Graph and Its Energy
JF - IJMSI
YR - 2012
JO - IJMSI
VO - 7
IS - 2
UR - http://ijmsi.ir/article-1-349-en.html
SP - 1
EP - 8
K1 - Common neighborhood graph
K1 - Congraph
K1 - Spectrum (of graph)
K1 - Energy (of graph).
AB - 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.
LA eng
UL http://ijmsi.ir/article-1-349-en.html
M3 10.7508/ijmsi.2012.02.001
ER -