全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

关于五个顶点不存在不对称的简单图
Simple Graphs about Five Vertices without Asymmetry

DOI: 10.12677/aam.2025.143108, PP. 220-228

Keywords: 图论,简单图,公共邻居
Graph Theory
, Simple Graph, Common Neighbour

Full-Text   Cite this paper   Add to My Lib

Abstract:

本文讨论五个顶点不存在不对称的简单图,基于对最小度 δ 进行讨论的基础上,从两个顶点是否相邻以及是否有公共邻居这个角度出发,利用反证法以及给出每种情况的具体画法,进而得出结论。近百年来,国内外很多学者都对这一问题进行了研究。由于涉及的画法较多且证明过程较为复杂,国内外关于此领域的研究进展缓慢。相比较而言,本文从特殊的视角出发使得问题较为轻松得到解决,更具创新性。
This paper discusses the simple graph of five vertices without asymmetry, based on the discussion of the minimum degree, from the point of view of whether the two vertices are adjacent and whether there are common neighbors, the conclusion is drawn by using the counter-evidence method and the specific drawing method of each case. In the past hundred years, many scholars at home and abroad have studied this problem. Due to the many drawings involved and the complexity of the proof process, the progress of domestic and foreign research in this field has been slow. In contrast, this paper makes the problem easier to be solved from a special perspective, which is more innovative.

References

[1]  Harary, F. (1972) Graph Theory. Addison-Wesley Publishing Company.
[2]  张瑜洁. 玫瑰花窗图R(3k, 3, 1)的交叉数[D]: [硕士学位论文]. 大连: 辽宁师范大学, 2024.
[3]  Bondy, J. and Murty, U. (1976) Graph Theory with Its Applications. American Elsevier.
https://doi.org/10.1007/978-1-349-03521-2
[4]  Zheng, W., Lin, X., Yang, Y. and Yang, X. (2008) The Crossing Number of Flower Snarks and Related Graphs. ARS Combinatoria, 86, 57-64.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133