Connected components in the invariably generating graph of a finite group

Abstract

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.