共 24 条
Hamiltonian cycles in the generating graphs of finite groups
被引:21
作者:
Breuer, T.
[1
]
Guralnick, R. M.
[2
]
Lucchini, A.
[3
]
Maroti, A.
[4
]
Nagy, G. P.
[5
]
机构:
[1] Rhein Westfal TH Aachen, Lehrstuhl Math D, D-52065 Aachen, Germany
[2] Univ So Calif, Dept Math, Los Angeles, CA 90089 USA
[3] Univ Padua, Dipartimento Matemat Pura & Applicata, I-35121 Padua, Italy
[4] MTA Alfred Renyi Inst Math, H-1053 Budapest, Hungary
[5] SZTE Bolyai Inst, H-6720 Szeged, Hungary
关键词:
PROBABILISTIC GENERATION;
D O I:
10.1112/blms/bdq017
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
For a finite group G let Gamma(G) denote the graph defined on the non-identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. In this paper it is shown that the graph Gamma(G) contains a Hamiltonian cycle for many finite groups G.
引用
收藏
页码:621 / 633
页数:13
相关论文