Title of article
The Common Neighborhood Graph and Its Energy
Author/Authors
Anwar Alwardi، Anwar نويسنده Department of Studies in Mathematics, , , Arsic، Branko نويسنده , , Gutman، Ivan نويسنده , , Soner، Nandappa D. نويسنده ,
Issue Information
دوفصلنامه با شماره پیاپی سال 2012
Pages
8
From page
1
To page
8
Abstract
Let G be a simple graph with vertex set {v1, v2, . . . ,vn}. The
common neighborhood graph (congraph) of G, denoted by con(G), is the
graph with vertex set {v1, v2, . . . , vn}, 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.
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Serial Year
2012
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Record number
690848
Link To Document