论立方顶点变换图的半圆自动形的阶数

IF 1 3区数学 Q1 MATHEMATICS

European Journal of Combinatorics Pub Date : 2024-11-26 DOI:10.1016/j.ejc.2024.104091

Marco Barbieri , Valentina Grazian , Pablo Spiga

引用次数: 0

摘要

我们证明，如果 Γ 是一个有限连接的立方顶点传递图，那么要么存在阶数至少为 6 的 Γ 的半圆自动形，要么 Γ 的顶点数在上面以一个绝对常数为界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the order of semiregular automorphisms of cubic vertex-transitive graphs

We prove that, if

Γ

is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of

Γ

of order at least 6, or the number of vertices of

Γ

is bounded above by an absolute constant.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

European Journal of Combinatorics 数学-数学

CiteScore

2.10

自引率

10.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.