Abstract
The generating graph of a finite group has vertex set the non-identity elements of , with two elements connected exactly when they generate . A coclique in a graph is an empty induced subgraph, so a coclique in is a subset of such that no pair of elements generate . A coclique is maximal if it is contained in no larger coclique. It is easy to see that the non-identity elements of a maximal subgroup of form a coclique in , but this coclique need not be maximal. In this paper we determine when the intransitive maximal subgroups of and are maximal cocliques in the generating graph. In addition, we prove a conjecture of Cameron, Lucchini, and Roney-Dougal [3] in the case of and , when n is prime and for all prime powers and . Namely, we show that two elements of have identical sets of neighbours in if and only if they belong to exactly the same maximal subgroups.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.