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