Connected components in the invariably generating graph of a finite group

preprint2021arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.