ON THE NUMBER OF CONNECTED COMPONENTS OF DIVISIBILITY GRAPH FOR CERTAIN SIMPLE GROUPS

被引：0

作者：

Abdolghafourian, Adeleh ^{[1
]}

Iranmanesh, Mohammad A. ^{[1
]}

机构：

[1] Yazd Univ, Dept Math, POB 89195-741, Yazd, Iran

来源：

TRANSACTIONS ON COMBINATORICS | 2016年 / 5卷 / 02期

关键词：

Divisibility graph; Connected component; Simple groups;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The divisibility graph D(G) for a finite group G is a graph with vertex set cs(G) \ {1} where cs(G) is the set of conjugacy class sizes of G. Two vertices a and b are adjacent whenever a divides b or b divides a. In this paper we will find the number of connected components of D(G) where G is a simple Zassenhaus group or an sporadic simple group.

引用

页码：33 / 40

页数：8

共 9 条

[1] DIVISIBILITY GRAPH FOR SYMMETRIC AND ALTERNATING GROUPS
Abdolghafourian, Adeleh
Iranmanesh, Mohammad A.
COMMUNICATIONS IN ALGEBRA, 2015, 43 (07) : 2852 - 2862
[2] The Divisibility Graph for F-Groups
D. Khoshnevis
Z. Mostaghim
Mathematical Notes, 2022, 111 : 236 - 242
[3] The Divisibility Graph for F-Groups
Khoshnevis, D.
Mostaghim, Z.
MATHEMATICAL NOTES, 2022, 111 (1-2) : 236 - 242
[4] The number of connected components in a graph associated with a rectangular (0,1)-matrix
Chen, Sheng
Liang, Li
Tian, Yunbo
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 487 : 74 - 85
[5] Optimal stopping for many connected components in a graph
Lason, Michal
RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (02) : 267 - 287
[6] On groups with chordal power graph, including a classification in the case of finite simple groups
Brachter, Jendrik
Kaja, Eda
JOURNAL OF ALGEBRAIC COMBINATORICS, 2023, 58 (04) : 1095 - 1124
[7] On groups with chordal power graph, including a classification in the case of finite simple groups
Jendrik Brachter
Eda Kaja
Journal of Algebraic Combinatorics, 2023, 58 : 1095 - 1124
[8] Simple groups with m-regular first prime graph component
Ghasemabadi, M. Foroudi
Iranmanesh, A.
HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS, 2016, 45 (03): : 705 - 716
[9] Computing connected components of simple undirected graphs based on generalized rough sets
Chen, Jinkun
Li, Jinjin
Lin, Yaojin
KNOWLEDGE-BASED SYSTEMS, 2013, 37 : 80 - 85

← 1 →