无向循环图

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI:10.1109/ISPAN.1994.367157

F. P. Muga

{"title":"无向循环图","authors":"F. P. Muga","doi":"10.1109/ISPAN.1994.367157","DOIUrl":null,"url":null,"abstract":"A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for degree /spl ges/6. A refinement on this upper bound is given in this paper. It is determined also that this maximal number is odd.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Undirected circulant graphs\",\"authors\":\"F. P. Muga\",\"doi\":\"10.1109/ISPAN.1994.367157\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for degree /spl ges/6. A refinement on this upper bound is given in this paper. It is determined also that this maximal number is odd.<<ETX>>\",\"PeriodicalId\":142405,\"journal\":{\"name\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.1994.367157\",\"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 of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.1994.367157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

设计大规模并行计算机系统和快速通信网络的一个基本问题是在给定网络直径和程度的情况下使节点数量最大化。这个最大值是由摩尔界限定的。对于无向循环图，也给出了一个上界，但没有找到阶/ splges /6的精确公式。本文给出了这个上界的一个改进。我们还确定这个最大值是奇数

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

查看原文本刊更多论文

Undirected circulant graphs

A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for degree /spl ges/6. A refinement on this upper bound is given in this paper. It is determined also that this maximal number is odd.<>

求助全文

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

来源期刊

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

自引率

0.00%

发文量