In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time Turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism, even when the group is presented as a permutation group via generators. On the other hand, the representability problem for general groups on trees is equivalent to checking, given a group G and n, whether a nontrivial homomorphism from G to S n exists. There does not seem to be a polynomial time algorithm for this problem, in spite of the fact that tree isomorphism has polynomial time algorithms. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Dutta, S., & Kurur, P. P. (2009). Representing groups on graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 295–306). https://doi.org/10.1007/978-3-642-03816-7_26
Mendeley helps you to discover research relevant for your work.