Common Neighborhood Graph

Subject Areas : Statistics

S. Hossein-Zadeh ¹ , A. Iranmanesh ² , A. Hamzeh ³ , M.A. Hosseinzadeh ⁴

1 - Department of Pure Mathematics, Tarbiat Modares University, Tehran, Iran
2 - Department of Pure Mathematics, Tarbiat Modares University, Tehran, Iran.
3 - Department of Pure Mathematics, Tarbiat Modares University, Tehran, Iran.
4 - Department of Pure Mathematics, Tarbiat Modares University, Tehran, Iran.

Received: 2016-01-21 Accepted : 2016-04-19 Published : 2016-05-21

Keywords: گراف همسایه مشترک, دور همیلتونی, عدد خوشه, اعمال گراف,

Abstract :

Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltonicity of graph G and con(G). Also, we obtain a lower bound for the clique number of con(G) in terms of clique number of graph G. Finally we state that the total chromatic number of G is bounded by chromatic number of con(T(G)).