Conjugacy classes of finite groups and graph regularity
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Abstract
Abstract
Given a finite group
G
, denote by
Γ
(
G
)
$\Gamma (G)$
the simple
undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of G , and set two vertices of
Γ
(
G
)
$\Gamma (G)$
to be
adjacent if and only if they are not coprime numbers. In this note we prove that, if
Γ
(
G
)
$\Gamma (G)$
is a
k
-regular graph with
k
≥ 1, then
Γ
(
G
)
$\Gamma (G)$
is a complete graph with
k
+
1
$k+1$
vertices.
Description
Journal Title
Forum Mathematicum
Conference Name
Journal ISSN
0933-7741
1435-5337
1435-5337
Volume Title
27
Publisher
De Gruyter
Publisher DOI
Rights and licensing
Except where otherwised noted, this item's license is described as http://www.rioxx.net/licenses/all-rights-reserved
