Representing Groups on Graphs

In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained versions of graph isomorphism in the papers [1], [2]. The problem of representing groups on graphs is believed to be harder than graph isomorphism. We discuss a recent result on representing groups on graphs [3]. We then consider the representability problem under a restricted setting where the input group is a constant group. We present a discussion on the applicability of these ideas for Turing reducing this problem to graph isomorphism.

• Type: Conference
• Year: 2009
• Where: MFCS
• Authors: Sagarmoy Dutta, Piyush P. Kurur
• Keywords: Constrained Versions, Graph Isomorphism, Group Theoretic Techniques, MFCS 2009