On Common Neighborhood Graphs II

نویسندگان
Iranmanesh, A. ID 1
Hamzeh, A. ID 2
Hossein-Zadeh, S. ID 3
Hosseinzadeh, M. A. ID 4
Gutman, I. ID 5

1 Tarbiat Modares University

2 Tarbiat Modares University

3 Tarbiat Modares University

4 Tarbiat Modares University

5 University of Kragujevac

doi
10.22052/ijmc.2017.53463.1195
چکیده

Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.

کلیدواژه‌ها
Common neighborhood graph, congraph, Mycielski graph, shadow graph, Haj´os join