On the number of connected components of divisibility graph for certain simple groups
The divisibility graph D(G) D(G) for a finite group G G is a graph with vertex set cs(G)∖{1} cs(G)∖{1} where cs(G) cs(G) is the set of conjugacy class sizes of G G. Two vertices a a and b b are adjacent whenever a a divides b b or b b divides a a. In this paper we will find the number of con...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2016-06-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/article_8595_8e231b4595dc014a92b1ce8c12a9732f.pdf |