Representing Groups on Graphs
From MaRDI portal
Abstract: 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 and , whether a nontrivial homomorphism from to 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 algorithm.
Recommendations
Cites work
- A note on the graph isomorphism counting problem
- Graph Isomorphism is in SPP
- Graph isomorphism is low for PP
- scientific article; zbMATH DE number 4007728 (Why is no real title available?)
- scientific article; zbMATH DE number 3722702 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
Cited in
(5)
This page was built for publication: Representing Groups on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182934)