完全图K31的电流图构造
The Construction of Current Graphs of the Complete Graph K31
DOI: 10.12677/ORF.2024.142224, PDF, 下载: 35  浏览: 45 
作者: 刘家宏：中央民族大学，理学院，北京
关键词: 完全图；电流图；线性方程组；Complete Graph； Current Graphs； System of Linear Equations
摘要: 本文根据电流图的构造原理，对K31的两类电流图分别构造了方程组，通过编程求解方程组，从而 得到了完全图K31的两类电流图的所有电流图分别有536和580个，为研究其可定向嵌入及染色等 相关问题奠定了基础。
Abstract: This paper mainly constructs equations for the two types of current graphs of K31 based on the construction principle of current graphs, and solves the equations by programming, obtaining 538 and 560 current graphs of the two types of current graphs of complete graph K31, which lays a foundation for the study of related problems such as orientable embedding and coloring.
文章引用：刘家宏. 完全图K31的电流图构造[J]. 运筹与模糊学, 2024, 14(2): 1270-1275. https://doi.org/10.12677/ORF.2024.142224

参考文献

[1] Korzhik, V. and Voss, H-J. (2001) On the Number of Non-Isomorphic Orientable Regular Embeddings of Complete Graphs. Journal of Combinatorial Theory, Series B, 81, 58-76.
https://doi.org/10.1006/jctb.2000.1993
[2] Ringel, G. (1974) Map Color Theorem. Springer-Verlag, Berlin.
[3] 高越, 李赵祥. 完全图在可定向曲面的三角剖分嵌入数[J]. 应用数学学报, 2021, 44(2): 175-187.
[4] 任韩, 白云. 图的指数多个最大亏格嵌人与完全图的亏格嵌入[J]. 中国科学: 数学, 2008, 38(5):595-600.

为你推荐