graph_exact_square (310B)
1 # Graph exact square 2 3 Given a [graph] G, the *exact square* of G is a graph G' on the same [vertices] where you connect each pair of vertices that are connected by a [walk] of length exactly 2 4 5 [graph_exact_square_root_problem] 6 7 Up: [graph_square] 8 9 See also: [graph_square_root], [graph_exact_distance_square]