On the Diameter of a Graph Related to Conjugacy Classes of Groups

David Chillag, Marcel Herzog, Avinoam Mann

Bulletin of the London Mathematical Society · 1993 · 36 citations · 0 references

Concepts

Abstract

Let G be a finite group. Attach to G the following graph Γ: its vertices are the non-central conjugacy classes of G, and two vertices are connected if their cardinalities are not co-prime. Denote by n(Γ) the number of the connected components of Γ. By [1], n(Γ) ⩽ 2 for all finite groups, and if Γ is connected, the diameter of the graph is at most 4. In this paper we prove that if Γ is connected, then the diameter of the graph is at most 3, and this bound is the best possible. Similar results are proved for infinite FC-groups.