两个圈的卡氏积的群超幻标号
Group Supermagic Labeling of the Cartesian Product of Two Cycles
DOI: 10.12677/pm.2025.157210, PDF,    国家自然科学基金支持
作者: 邓贵新*, 刘宇浩:南宁师范大学数学与统计学院,广西 南宁
关键词: 超幻标号群超幻标号图的卡氏积Supermaigc Labeling Group Supermagic Labeling Cartesian Product of Graph
摘要: 图的各种幻型标号的存在性是近年来图论中的一个研究热点。在该领域的研究中用到了图论、群论、数论、线性代数等数学工具。设 G=( V,E ) 是一个有限简单图, A 是一个有限交换群。 G 的一个 A -超幻标号是一个双射 φ:EA ,满足存在 cA ,使得对所有的 xV ,有 eE( x ) φ( e ) =c ,其中 E( x ) 代表所有与顶点 x 关联的边的集合。对任意 n3 ,记 C n n 个顶点的圈。我们利用有限交换群元素的排列得到了 C m C n A -超幻标号存在性的新的充分条件。
Abstract: The existence of various magic-type labeling of graphs is a research hotspot in recent years. Many mathematical tools, such as graph theory, group theory, number theory, and linear algebra, are used in the research of this area. Let G=( V,E ) be a finite simple graph and let A be a finite abelian group. An A -supermagic labeling of G is a bijection φ:EA which satisfies that there exists cA , such that eE( x ) φ( e ) =c for any xV , where E( x ) is the set of edges which adjacent to x . For any n3 , let C n denote the cycle with n vertices. We use some results on the arrangement of elements of finite abelian groups to obtain new sufficient conditions such that the Cartesian product of cycles C m C n admits A -supermagic labeling.
文章引用:邓贵新, 刘宇浩. 两个圈的卡氏积的群超幻标号[J]. 理论数学, 2025, 15(7): 83-89. https://doi.org/10.12677/pm.2025.157210

参考文献

[1] Hartsfield, N. and Ringel, G. (1990) Pearls in Graph Theory: A Comprehensive Introduction. Dover Publications.
[2] Cranston, D.W. (2008) Regular Bipartite Graphs Are Antimagic. Journal of Graph Theory, 60, 173-182. [Google Scholar] [CrossRef
[3] Cheng, Y. (2008) A New Class of Antimagic Cartesian Product Graphs. Discrete Mathematics, 308, 6441-6448. [Google Scholar] [CrossRef
[4] Liang, Y. and Zhu, X. (2013) Anti-Magic Labelling of Cartesian Product of Graphs. Theoretical Computer Science, 477, 1-5. [Google Scholar] [CrossRef
[5] Liang, Y., Wong, T. and Zhu, X. (2014) Anti-Magic Labeling of Trees. Discrete Mathematics, 331, 9-14. [Google Scholar] [CrossRef
[6] Alon, N., Kaplan, G., Lev, A., Roditty, Y. and Yuster, R. (2004) Dense Graphs Are Antimagic. Journal of Graph Theory, 47, 297-309. [Google Scholar] [CrossRef
[7] Stewart, B.M. (1966) Magic Graphs. Canadian Journal of Mathematics, 18, 1031-1059. [Google Scholar] [CrossRef
[8] Stewart, B.M. (1967) Supermagic Complete Graphs. Canadian Journal of Mathematics, 19, 427-438. [Google Scholar] [CrossRef
[9] Ivančo, J. (2000) On Supermagic Regular Graphs. Mathematica Bohemica, 125, 99-114. [Google Scholar] [CrossRef
[10] Ivančo, J. (2016) Supermagic Generalized Double Graphs. Discussiones Mathematicae Graph Theory, 36, 211-225. [Google Scholar] [CrossRef
[11] Froncek, D., Paananen, P. and Sorensen, L. (2024) Group-Supermagic Labeling of Cartesian Products of Two Even Cycles. Discrete Mathematics, 347, Article ID: 113741. [Google Scholar] [CrossRef
[12] Zeng, X., Deng, G. and Luo, C. (2023) Characterize Group Distance Magic Labeling of Cartesian Product of Two Cycles. Discrete Mathematics, 346, Article ID: 113407. [Google Scholar] [CrossRef
[13] Deng, G., Geng, J. and Zeng, X. (2024) Group Distance Magic Labeling of Tetravalent Circulant Graphs. Discrete Applied Mathematics, 342, 19-26. [Google Scholar] [CrossRef