DeepAI AI Chat
Log In Sign Up

Recognizing the Commuting Graph of a Finite Group

by   V. Arvind, et al.
The Institute of Mathematical Sciences, Chennai
University of St Andrews

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph X is it the commuting graph of a group G? And if so, to determine such a group. We seek efficient algorithms for this problem. We make some general observations on this problem, and obtain a polynomial-time algorithm for the case of extraspecial groups.


page 1

page 2

page 3

page 4


The Isomorphism Problem of Power Graphs and a Question of Cameron

The isomorphism problem for graphs (GI) and the isomorphism problem for ...

On the functional graph of the power map over finite groups

In this paper we study the description of the digraph associated with th...

Algorithms for the Minimum Generating Set Problem

For a finite group G, the size of a minimum generating set of G is denot...

Certifiably Polynomial Algorithm for Best Group Subset Selection

Best group subset selection aims to choose a small part of non-overlappi...

Testability in group theory

This paper is a journal counterpart to our FOCS 2021 paper, in which we ...

Graph subshifts

We propose a definition of graph subshifts of finite type that can be se...

Mixing of 3-term progressions in Quasirandom Groups

In this note, we show the mixing of three-term progressions (x, xg, xg^2...