Representations of Borel Cayley graphs

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234888

K. W. TANGt, Biuce W. Arden

引用次数: 24

Abstract

It is shown that all degree-4 Borel Cayley graphs can also be represented by more restrictive chordal rings (CRs) through a constructive proof. All bidirectional, degree-4 Borel Cayley graphs have the more restrictive CR representations, and hence Hamiltonian cycles always exist for these graphs. A step-by-step algorithm to transform any degree-4 Borel Cayley graph into CR graphs is provided. Examples are used to illustrate this concept.<>

查看原文本刊更多论文

Borel - Cayley图的表示

通过构造证明，证明了所有的4次Borel Cayley图也可以用更严格的弦环表示。所有双向，4次Borel Cayley图都具有更严格的CR表示，因此这些图总是存在哈密顿环。一步一步的算法，以转换任何程度-4 Borel Cayley图到CR图提供。例子是用来说明这个概念的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量