Abstract
The Sylow graph of a finite group originated from recent investigations on the so--called --closed classes of groups. The connectivity of was proved only few years ago, involving the classification of finite simple groups, and the structure of may be strongly restricted, once information on are given. The first result of the present paper deals with a condition on --closed classes of groups. The second result deals with a computational criterion, related to the connectivity of .
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.