Volume 7, Issue 2 (11-2012)                   IJMSI 2012, 7(2): 1-8 | Back to browse issues page

XML Print


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.

Type of Study: Research paper | Subject: General

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.