This work focuses on mapping landscape connectivity by making use of a subdivision of a Harary graph through super edge antimagic total labeling. This study employs a Harary graph by inserting h vertices in each edge, where h = 2n, n ≥ 1 using the super (a, 2) edge antimagic total labeling and labeling the vertices and edges by taking the difference of arithmetic progression as 2 i.e. d = 2. We divided this paper into two parts. In first part, when the order of the subdivided harary graphs p varies then the distance t will remain the same, while in the other part, when the order p varies then distance t will also vary.