On the Soluble Graph of a Finite Simple Group

The maximal independent sets of the soluble graph of a finite simple group G are studied and their independence number is determined. In particular, it is shown that this graph in many cases has an independent set with three vertices.

Saved in:
Bibliographic Details
Published in:Communications in algebra 2013-05, Vol.41 (6), p.2297-2309
Main Authors: Amberg, Bernhard, Kazarin, Lev
Format: Article
Language:English
Subjects:
Algebra
Finite simple group
Grünberg-Kegel graph or prime graph
Independence number
Soluble graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The maximal independent sets of the soluble graph of a finite simple group G are studied and their independence number is determined. In particular, it is shown that this graph in many cases has an independent set with three vertices.
ISSN:0092-7872
1532-4125
DOI:10.1080/00927872.2012.656336