The graph isomorphism problem is polynomial

Details The graph isomorphism problem is polynomial The graph isomorphism problem is polynomial

2006-07-29

arxiv.org/abs/math/0607770v2

Mathematics

General Mathematics

9 pages, Latex2e

Scientific paper

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties of regular $k$-partitions that, on one hand, generalize automorphic $k$-partitions (=systems of $k$-orbits of permutation groups), and, on other hand, schemes of relations (strongly regular 2-partitions or regular 3-partitions), that are a subject of the algebraic combinatorics. It is shown that the stabilization of a graph by quadrangles detects the triviality of the graph automorphism group. The result is obtained by lineariation of the algebraic combinatorics. Keywords: $k$-partitions, symmetry, algebraic combinatorics

Affiliated with

Also associated with

No associations

Rating

The graph isomorphism problem is polynomial 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 The graph isomorphism problem is polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The graph isomorphism problem is polynomial will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333601