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: | Adeleh Abdolghafourian, Mohammad Ali Iranmanesh |
---|---|
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 |
Similar Items
-
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity
by: Mei-Mei Gu, et al.
Published: (2019-01-01) -
Indexing Simple Graphs by Means of the Resistance Distance
by: Chatchawit Aporntewan, et al.
Published: (2016-01-01) -
Quasirecognition by prime graph of finite simple groups ${}^2D_n(3)$
by: Behrooz Khosravi, et al.
Published: (2014-12-01) -
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
by: Hossein Moradi, et al.
Published: (2018-04-01) -
Recognition of the simple groups $PSL_2(q)$ by character degree graph and order
by: Zeinab Akhlaghi, et al.
Published: (2019-06-01)