The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determining if a given graph G is the square of some graph is not easy in general. Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph. The graph introduced in their reduction is a graph that contains many triangles and is relatively dense. Farzad et al. proved thearXiv:1210.7684v1 fatcat:75g3etssonfa5e3gpqgl4itqna