有限循环群的Cayley有向图的宽直径

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008) Pub Date : 2008-05-07 DOI:10.1109/I-SPAN.2008.19

Xingde Jia

{"title":"有限循环群的Cayley有向图的宽直径","authors":"Xingde Jia","doi":"10.1109/I-SPAN.2008.19","DOIUrl":null,"url":null,"abstract":"According to recent studies, communication networks built on extremal Cayley digraphs of finite cyclic groups have many advantages over that based on n-cubes. Extremal Cayley digraphs have been studied extensively in recent years. In this paper, we prove, for every positive integer k, that the k-wide diameter of the Cayley digraph Cay(Zm, A) is at most diam(Cay(Zm, A)) + 1 if A is an \"m-ideal\" set of k positive integers.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Wide Diameter of Cayley Digraphs of Finite Cyclic Groups\",\"authors\":\"Xingde Jia\",\"doi\":\"10.1109/I-SPAN.2008.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"According to recent studies, communication networks built on extremal Cayley digraphs of finite cyclic groups have many advantages over that based on n-cubes. Extremal Cayley digraphs have been studied extensively in recent years. In this paper, we prove, for every positive integer k, that the k-wide diameter of the Cayley digraph Cay(Zm, A) is at most diam(Cay(Zm, A)) + 1 if A is an \\\"m-ideal\\\" set of k positive integers.\",\"PeriodicalId\":305776,\"journal\":{\"name\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SPAN.2008.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

根据最近的研究，建立在有限循环群的极值Cayley有向图上的通信网络比建立在n-立方体上的通信网络有许多优点。近年来，人们对极值凯利有向图进行了广泛的研究。本文证明了对于每一个正整数k，如果A是k个正整数的“m-理想”集，那么Cayley有向图Cay(Zm, A)的k宽直径不大于(Cay(Zm, A)) + 1。

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

查看原文本刊更多论文

Wide Diameter of Cayley Digraphs of Finite Cyclic Groups

According to recent studies, communication networks built on extremal Cayley digraphs of finite cyclic groups have many advantages over that based on n-cubes. Extremal Cayley digraphs have been studied extensively in recent years. In this paper, we prove, for every positive integer k, that the k-wide diameter of the Cayley digraph Cay(Zm, A) is at most diam(Cay(Zm, A)) + 1 if A is an "m-ideal" set of k positive integers.

求助全文

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

来源期刊

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

自引率

0.00%

发文量