Characterizing and recognizing exact-distance squares of graphs
Y Bai, PP Cortés, R Naserasr, DA Quiroz - Discrete Mathematics, 2024 - Elsevier
For a graph G=(V, E), its exact-distance square, G [♯ 2], is the graph with vertex set V and
with an edge between vertices x and y if and only if x and y have distance (exactly) 2 in G …
with an edge between vertices x and y if and only if x and y have distance (exactly) 2 in G …