Borel - Cayley图的表示

[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

{"title":"Borel - Cayley图的表示","authors":"K. W. TANGt, Biuce W. Arden","doi":"10.1109/FMPC.1992.234888","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Representations of Borel Cayley graphs\",\"authors\":\"K. W. TANGt, Biuce W. Arden\",\"doi\":\"10.1109/FMPC.1992.234888\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1992.234888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 24

摘要

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

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

查看原文本刊更多论文

Representations of Borel Cayley graphs

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量