On cubic non-Cayley vertex-transitive graphs

被引：7

作者：

Kutnar, Klavdija ^{[1
]}

Marusic, Dragan ^{[1
,2
]}

Zhang, Cui ^{[1
]}

机构：

[1] Univ Primorska, Koper 6000, Slovenia

[2] Univ Ljubljana, Ljubljana 1000, Slovenia

来源：

JOURNAL OF GRAPH THEORY | 2012年 / 69卷 / 01期

关键词：

vertex-transitive graph; non-Cayley graph; automorphism group; GENERALIZED PETERSEN GRAPHS; AUTOMORPHISM-GROUPS; SYMMETRICAL GRAPHS; ORDER; PRODUCT; PRIME; COVERINGS; TWICE;

D O I：

10.1002/jgt.20573

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In 1983, the second author [D. Marusic, Ars Combinatoria 16B (1983), 297302] asked for which positive integers n there exists a non-Cayley vertex-transitive graph on n vertices. (The term non-Cayley numbers has later been given to such integers.) Motivated by this problem, Feng [Discrete Math 248 (2002), 265269] asked to determine the smallest valency (n) among valencies of non-Cayley vertex-transitive graphs of order n. As cycles are clearly Cayley graphs, n >= 3 for any non-Cayley number n.

引用

页码：77 / 95

页数：19

共 45 条

[1] A CONSTRUCTION FOR VERTEX-TRANSITIVE GRAPHS [J].