增广立方体AQn交叉数下界的改进
n improved lower bound for the crossing number of Augmented cubes
图G的交叉数是指在一个G的画法中，边之间所造成的最少交叉点数。交叉数问题的应用领域很广泛，比如在网络拓扑结构、VLSL芯片制造等方面有较多应用。本文主要通过构造法与证明相结合的方式，对增广立方体AQn的交叉数下界进行改进。
he crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. In the past thirty years,it turned out that crossing number played an important role not only in various fields of discrete and computational geometry but also in VLSI theory and wiring layout problems. In this paper, we obtain the lower bound of cr(AQn) and and in Section 2, we give the proof of the lower bound.
杨雪芝、杨元生
数学
图论画法交叉数增广立方体互联网络
Graph TheoryDrawingCrossing numberAugmented cubeInterconnection network
杨雪芝,杨元生.增广立方体AQn交叉数下界的改进[EB/OL].(2011-11-07)[2025-08-18].http://www.paper.edu.cn/releasepaper/content/201111-109.点此复制
评论