AI Chat AI Image Generator AI Video Text to Speech

Recognizing the Commuting Graph of a Finite Group

06/02/2022

∙

by V. Arvind, et al.

∙

∙

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.

V. Arvind
15 publications
Peter J. Cameron
5 publications

page 1

page 2

page 3

page 4

research

∙ 05/30/2023

The Isomorphism Problem of Power Graphs and a Question of Cameron

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

0 Bireswar Das, et al. ∙

research

∙ 07/01/2021

On the functional graph of the power map over finite groups

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

0 Claudio Qureshi, et al. ∙

research

∙ 04/23/2021

Certifiably Polynomial Algorithm for Best Group Subset Selection

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

0 Yanhang Zhang, et al. ∙

research

∙ 04/09/2022

Testability in group theory

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

0 Oren Becker, et al. ∙

research

∙ 02/14/2023

Graph subshifts

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

0 Pablo Arrighi, et al. ∙

research

∙ 05/15/2023

Algorithms for the Minimum Generating Set Problem

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

0 Bireswar Das, et al. ∙

research

∙ 09/26/2021

Mixing of 3-term progressions in Quasirandom Groups

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

0 Amey Bhangale, et al. ∙