关于奇数阶阿贝尔凯莱图与K2乘积的稳定性
On the Stability of Odd-Order Abelian Cayley Graphs Producted with K2
DOI: 10.12677/aam.2026.1511440, PDF,   
作者: 李静仪:重庆师范大学数学科学学院,重庆
关键词: 凯莱图;乘积;交换群;Cayley Graph; Product; Abelian Group
摘要: 在2021年,Morris证明了奇数阶交换凯莱图要么稳定,要么非平凡不稳定。以此为启发,本文考虑二倍奇数阶交换凯莱图的稳定性,主要刻画了奇数阶交换凯莱图在允许二阶完全图作为笛卡尔乘积因子或强乘积因子时的稳定性。通过考虑上述两种二倍奇数阶交换凯莱图的TF-自同构群性质,利用图的TF-自同构来研究图的稳定性,再根据上述图稳定的定义,可进一步得到研究的结论。
Abstract: In 2021, Morris proved that odd-order abelian Cayley graphs are either stable or nontrivially unstable. Inspired by this, this paper considers the stability of abelian Cayley graphs of twice odd order. It mainly characterizes the stability of odd-order abelian Cayley graphs when they allow the complete graph of order two as a Cartesian product factor or a strong product factor. By considering the TF-automorphism group properties of the above two types of abelian Cayley graphs of twice odd order, and using graph TF-automorphisms to study graph stability, according to the above definition of graph stability, the conclusions of the study can be further obtained.
文章引用:李静仪. 关于奇数阶阿贝尔凯莱图与K2乘积的稳定性[J]. 应用数学进展, 2026, 15(11): 167-175. https://doi.org/10.12677/aam.2026.1511440

参考文献

[1] Morris, D.W. (2021) On Automorphisms of Direct Products of Cayley Graphs on Abelian Groups. The Electronic Journal of Combinatorics, 28, 1-10.
https://doi.org/10.37236/9940
[2] Kotlov, A. and Lovász, L. (1996) The Rank and Size of Graphs. Journal of Graph Theory, 23, 185-189.
https://doi.org/10.1002/(sici)1097-0118(199610)23:2<185::aid-jgt9>3.3.co;2-x
[3] Marušič, D., Scapellato, R. and Salvi, N.Z. (1992) Generalized Cayley Graphs. Discrete Mathematics, 102, 279-285.
https://doi.org/10.1016/0012-365x(92)90121-u
[4] Surowski, D.B. (2001) Stability of Arc-Transitive Graphs. Journal of Graph Theory, 38, 95-110.
https://doi.org/10.1002/jgt.1026
[5] Wilson, S. (2008) Unexpected Symmetries in Unstable Graphs. Journal of Combinatorial Theory, Series B, 98, 359-383.
https://doi.org/10.1016/j.jctb.2007.08.001
[6] Qin, Y., Xia, B. and Zhou, S. (2019) Stability of Circulant Graphs. Journal of Combinatorial Theory, Series B, 136, 154-169.
https://doi.org/10.1016/j.jctb.2018.10.004
[7] Hujdurović, A., Mitrović, Đ. and Witte Morris, D. (2023) Automorphisms of the Double Cover of a Circulant Graph of Valency at Most 7. Algebraic Combinatorics, 6, 1235-1271.
https://doi.org/10.5802/alco.303
[8] Jiang, H. and Zhang, J. (2025) Constructing Unstable Graphs from Bipartite Graphs. Bulletin of the Malaysian Mathematical Sciences Society, 48, Article No. 134.
https://doi.org/10.1007/s40840-025-01913-6
[9] Hammack, R.H. and Imrich, W. (2009) On Cartesian Skeletons of Graphs. Ars Mathematica Contemporanea, 2, 191-205.
https://doi.org/10.26493/1855-3974.114.4bb
[10] Hammack, R., Imrich, W. and Klavžar, S. (2011) Handbook of Product Graphs. 2nd Edition, CRC Press.
[11] Fernandez, B. and Hujdurović, A. (2022) Canonical Double Covers of Circulants. Journal of Combinatorial Theory, Series B, 154, 49-59.
https://doi.org/10.1016/j.jctb.2021.12.005
[12] Hujdurović, A., Mitrović, Đ. and Morris, D.W. (2021) On Automorphisms of the Double Cover of a Circulant Graph. The Electronic Journal of Combinatorics, 28, 1-25.
https://doi.org/10.37236/10655