On finite 2-distance-primitive graphs

被引:0
|
作者
Ruan, Jie [1 ]
Liu, Weijun [2 ]
Jin, Wei [3 ]
机构
[1] Northeast Normal Univ, Sch Math & Stat, Changchun 130024, Jilin, Peoples R China
[2] Cent South Univ, Sch Math & Stat, HNP LAMA, Changsha 410083, Hunan, Peoples R China
[3] Xiangtan Univ, Sch Math & Computat Sci, Key Lab Intelligent Comp & Informat Proc, Minist Educ, Xiangtan 411105, Hunan, Peoples R China
关键词
Graphs; 2-distance; -primitive; Primitive groups; SYMMETRICAL GRAPHS; 2-ARC-TRANSITIVE GRAPHS; TRANSITIVE GRAPHS; PRIMITIVE GRAPHS; ORDER; PRODUCT; CLASSIFICATION;
D O I
10.1016/j.disc.2024.113978
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A vertex -transitive graph is called 2 -distance -primitive if the vertex stabilizer is primitive on both the first step and the second step neighborhoods. This paper first shows that there are infinitely many 2 -distance -primitive graphs with unbounded large valency and diameter. Then a classification is given of the 2 -distance -primitive graphs with valency at most 9. Finally, we determine all the 2 -distance -primitive graphs with the order of a product of two primes. (c) 2024 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条