DeepAI AI Chat
Log In Sign Up

The Isomorphism Problem of Power Graphs and a Question of Cameron

by   Bireswar Das, et al.
IIT Gandhinagar

The isomorphism problem for graphs (GI) and the isomorphism problem for groups (GrISO) have been studied extensively by researchers. The current best algorithms for both these problems run in quasipolynomial time. In this paper, we study the isomorphism problem of graphs that are defined in terms of groups, namely power graphs, directed power graphs, and enhanced power graphs. It is not enough to check the isomorphism of the underlying groups to solve the isomorphism problem of such graphs as the power graphs (or the directed power graphs or the enhanced power graphs) of two nonisomorphic groups can be isomorphic. Nevertheless, it is interesting to ask if the underlying group structure can be exploited to design better isomorphism algorithms for these graphs. We design polynomial time algorithms for the isomorphism problems for the power graphs, the directed power graphs and the enhanced power graphs arising from finite nilpotent groups. In contrast, no polynomial time algorithm is known for the group isomorphism problem, even for nilpotent groups of class 2. We note that our algorithm does not require the underlying groups of the input graphs to be given. The isomorphism problems of power graphs and enhanced power graphs are solved by first computing the directed power graphs from the input graphs. The problem of efficiently computing the directed power graph from the power graph or the enhanced power graph is due to Cameron [IJGT'22]. Therefore, we give a solution to Cameron's question.


page 1

page 2

page 3

page 4


Recognizing the Commuting Graph of a Finite Group

In this paper we study the realizability question for commuting graphs o...

Õ(n^1/3)-Space Algorithm for the Grid Graph Reachability Problem

The directed graph reachability problem takes as input an n-vertex direc...

On the Weisfeiler-Leman Dimension of Finite Groups

In comparison to graphs, combinatorial methods for the isomorphism probl...

Reconfiguring Directed Trees in a Digraph

In this paper, we investigate the computational complexity of subgraph r...

Space-Efficient Algorithms for Reachability in Geometric Graphs

The problem of graph Reachability is to decide whether there is a path f...

The Power Word Problem in Graph Products

The power word problem of a group G asks whether an expression p_1^x_1… ...

A Heuristic for Direct Product Graph Decomposition

In this paper we describe a heuristic for decomposing a directed graph i...