arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1104.3208cs.DM
收藏

有界度和直径为O(log n)的Hamilton图的构造

Constructions of hamiltonian graphs with bounded degree and diameter O (log n)

Aleksandar Ili\' c, Dragan Stevanovi\' c

摘要:

令牌环拓扑结构在分布式环路计算机网络的设计中得到了广泛的应用,其直径是衡量其性能的指标之一。提出了一个构造具有$n$顶点、最大度$Δ$和直径$O (\log n)$的哈密尔顿图的算法,其中$n$为任意数.边的数目由$(2 - \frac{1}{Δ- 1} - \frac{(Δ- 2)^2}{(Δ- 1)^3}) n$渐近地限定。特别地,我们构造了一类直径至多为$2 \lfloor \log_2 n \rfloor$,最大度为3,边数至多为$1+11n/8$的Hamilton图.

英文摘要:

Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum degree $Δ$ and diameter $O (\log n)$, where $n$ is an arbitrary number. The number of edges is asymptotically bounded by $(2 - \frac{1}{Δ- 1} - \frac{(Δ- 2)^2}{(Δ- 1)^3}) n$. In particular, we construct a family of hamiltonian graphs with diameter at most $2 \lfloor \log_2 n \rfloor$, maximum degree 3 and at most $1+11n/8$ edges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑