## Square Root Finding In Graphs

##### Abstract

Abstract: Root and root finding are concepts familiar to most
branches of mathematics.
In graph theory, H is a square root of G
and G is the square of 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.
Graph square is a basic operation
with a number of results about its properties in the literature.
We study the characterization
and recognition problems of graph powers.
There are algorithmic and computational approaches to answer the
decision problem of whether a given graph is a certain power of any graph.
There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four.
The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five.
We settle the conjecture that recognition of square of graphs with
girth 5 is NP-complete.
This result is providing the complete dichotomy theorem for square root finding problem.