Computing Graph Roots Without Short Cycles

Details Computing Graph Roots Without Short Cycles Computing Graph Roots Without Short Cycles

2009-02-12

arxiv.org/abs/0902.2150v1

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 397-408

Computer Science

Discrete Mathematics

Scientific paper

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 H2, however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squares of graphs of small girth, i.e. to determine if G = H2 for some graph H of small girth. The main results are the following. - There is a graph theoretical characterization for graphs that are squares of some graph of girth at least 7. A corollary is that if a graph G has a square root H of girth at least 7 then H is unique up to isomorphism. - There is a polynomial time algorithm to recognize if G = H2 for some graph H of girth at least 6. - It is NP-complete to recognize if G = H2 for some graph H of girth 4. These results almost provide a dichotomy theorem for the complexity of the recognition problem in terms of girth of the square roots. The algorithmic and graph theoretical results generalize previous results on tree square roots, and provide polynomial time algorithms to compute a graph square root of small girth if it exists. Some open questions and conjectures will also be discussed.

Affiliated with

Also associated with

No associations

Rating

Computing Graph Roots Without Short Cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Graph Roots Without Short Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Graph Roots Without Short Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556735