The 3-distance graph D3(G) of a graph G is the graph with vertex
set V (G) in which two vertices are adjacent if and only if the distance between them is 3 in the graph G. In this paper, we give some
properties of the 3-distance graphs of graphs.