To a simple graph G=(V, E), we correspond a simple graph G△ , □ whose vertex set is {{x, y}: x, y∈ V} and two vertices {x, y}, {z, w}∈ G△ , □ are adjacent if and only if {x, z}, {x, w}, {y, z}, {y, w}∈ V∪ E. The graph G△ , □ is called the (△ , □ )-edge graph of the graph G. In this paper, our ultimate goal is to provide a link between the connectedness of G and G△ , □ .