Classification of edge-transitive Nest graphs

被引：0
|
作者：
Kovacs, Istvan [1 ,2 ]
机构：
[1] Univ Primorska, UP IAM, Muzejski Trg 2, Koper 6000, Slovenia
[2] Univ Primorska, UP FAMNIT, Glagoljaska Ul 8, Koper 6000, Slovenia
来源：
GRAPHS AND COMBINATORICS | 2023年 / 39卷 / 04期
关键词：
Bicirculant; Edge-transitive;
D O I：
10.1007/s00373-023-02659-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A finite simple graph F is called a Nest graph if it is regular of valency 6 and admits an automorphism with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. In this paper, we complete classification of the edge-transitive Nest graphs and by this solve the problem posed by Jajcay et al. (Electron J Comb 26:#P2.6, 2019).
引用
收藏
页数：14
相关论文
共 50 条
12345