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

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Alwardi A, Arsic B, Gutman I, Soner N D. The Common Neighborhood Graph and Its Energy. IJMSI 2012; 7 (2) :1-8
URL: http://ijmsi.ir/article-1-349-en.html

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

Add your comments about this article : Your username or Email:

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

© 2024 CC BY-NC 4.0 | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb