Perfect matching transitivity of circulant graphs

被引：0

作者：

Reiter, Isaac A. ^{[1
]}

Zhou, Ju ^{[1
]}

机构：

[1] Kutztown Univ Penn, Kutztown, PA 19530 USA

来源：

ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS | 2022年 / 10卷 / 02期

关键词：

automorphism; vertex-transitive; edge-transitive; perfect matching; perfect matching transitivity; PM-transitive; circulant graph; VERTEX;

D O I：

10.5614/ejgta.2022.10.2.14

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M-1 and M-2 of G, there is an automorphism f : V (G) -> V (G) such that f(e)(M-1) = M-2, where f(e)(uv) = f(u)f(v). In this paper, the authors completely characterize the perfect matching transitivity of circulant graphs of order less than or equal to 10.

引用

页码：541 / 552

页数：12

共 18 条

[1] THE CLASSIFICATION OF HAMILTONIAN GENERALIZED PETERSEN GRAPHS
ALSPACH, B
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (03) : 293 - 312
[2] Babai L., 1995, Handbook of Combinatorics, VII, P1447
[3] Biggs N., 1993, Algebraic Graph Theory, V2nd ed., P118
[4] VERTEX AND EDGE TRANSITIVE, BUT NOT 1-TRANSITIVE, GRAPHS
BOUWER, IZ
[J]. CANADIAN MATHEMATICAL BULLETIN, 1970, 13 (02): : 231 - &
[5] Conder M., 2000, Journal of Combinatorial Mathematics and Combinatorial Computing, V20, P41
[6] A conjecture concerning a limit of non-Cayley graphs
Diestel, R
Leader, I
[J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 2001, 14 (01) : 17 - 25
[7] Foster R. M., 1988, FOSTER CENSUS R M FO
[8] Foster RM, 1932, Transactions of the American Institute of ElectricalEngineers, V51, P309, DOI [10.1109/T-AIEE.1932.5056068, DOI 10.1109/T-AIEE.1932.5056068]
[9] GROUPS OF GENERALIZED PETERSEN GRAPHS
FRUCHT, R
GRAVER, JE
WATKINS, ME
[J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1971, 70 (SEP): : 211 - &
[10] Godsil C., 2013, ALGEBRAIC GRAPH THEO, V207

← 1 2 →