The Common Neighborhood Graph and Its Energy

Alwardi, Anwar and Arsic, Branko and Gutman, I. and Soner, N. D. (2012) The Common Neighborhood Graph and Its Energy. Iranian Journal of Mathematical Sciences and Informatics, 7 (2). pp. 1-8.

Text (Full Text)
admin-A-10-1-112-83d86b7.pdf - Published Version

Download (107Kb) | Preview
Official URL:


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

Item Type: Article
Subjects: Physical Sciences > Mathematics
Divisions: PG Campuses > Manasagangotri, Mysore > Mathematics
Depositing User: Kodandarama
Date Deposited: 07 Oct 2013 09:51
Last Modified: 02 Nov 2015 11:07

Actions (login required)

View Item View Item