一类广义de Bruijn图的直径

Jaime D. L. Caro, Tedros Weldemicael Zeratsion
{"title":"一类广义de Bruijn图的直径","authors":"Jaime D. L. Caro, Tedros Weldemicael Zeratsion","doi":"10.1109/ISPAN.2002.1004286","DOIUrl":null,"url":null,"abstract":"The generalized de Bruijn digraph denoted by G/sub B/(n, m) is defined to be the digraph with m vertices labelled by 0, 1, 2, ..., m-1 and with the adjacency defined as follows: If i is a vertex in G/sub B/(n, m) then i is connected to each vertex in the set E(i), where E(i)={ni+/spl alpha/(mod m)|/spl alpha//spl isin/[0, n-1]}. The generalized de Bruijn graph denoted by UG/sub B/(n, m) is defined to be the undirected version of G/sub B/(n, m) obtained by replacing each arc by an undirected edge and eliminating self-loops and multi-edges. In this paper we show that the diameter of UG/sub B/(n, m) is 2 for any m in [n+1, n/sup 2/] where n divides m and that the diameter is 3 for any m in [n/sup 2/+1, n/sup 3/] where n divides m.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On the diameter of a class of the generalized de Bruijn graphs\",\"authors\":\"Jaime D. L. Caro, Tedros Weldemicael Zeratsion\",\"doi\":\"10.1109/ISPAN.2002.1004286\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The generalized de Bruijn digraph denoted by G/sub B/(n, m) is defined to be the digraph with m vertices labelled by 0, 1, 2, ..., m-1 and with the adjacency defined as follows: If i is a vertex in G/sub B/(n, m) then i is connected to each vertex in the set E(i), where E(i)={ni+/spl alpha/(mod m)|/spl alpha//spl isin/[0, n-1]}. The generalized de Bruijn graph denoted by UG/sub B/(n, m) is defined to be the undirected version of G/sub B/(n, m) obtained by replacing each arc by an undirected edge and eliminating self-loops and multi-edges. In this paper we show that the diameter of UG/sub B/(n, m) is 2 for any m in [n+1, n/sup 2/] where n divides m and that the diameter is 3 for any m in [n/sup 2/+1, n/sup 3/] where n divides m.\",\"PeriodicalId\":255069,\"journal\":{\"name\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2002.1004286\",\"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 International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2002.1004286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

用G/下标B/(n, m)表示的广义de Bruijn有向图定义为具有m个顶点的有向图,标记为0,1,2,…如果i是G/sub B/(n, m)中的一个顶点,则i与集合E(i)中的每个顶点相连,其中E(i)={ni+/spl alpha/(mod m)|/spl alpha//spl isin/[0, n-1]}。定义为UG/sub B/(n, m)的广义de Bruijn图为G/sub B/(n, m)的无向版本,通过用无向边代替每个弧,并消除自环和多边。在本文中,我们证明了对于[n+1, n/sup 2/]中n能除m的任意m, UG/下标B/(n, m)的直径为2;对于[n/sup 2/+1, n/sup 3/]中n能除m的任意m,其直径为3。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the diameter of a class of the generalized de Bruijn graphs
The generalized de Bruijn digraph denoted by G/sub B/(n, m) is defined to be the digraph with m vertices labelled by 0, 1, 2, ..., m-1 and with the adjacency defined as follows: If i is a vertex in G/sub B/(n, m) then i is connected to each vertex in the set E(i), where E(i)={ni+/spl alpha/(mod m)|/spl alpha//spl isin/[0, n-1]}. The generalized de Bruijn graph denoted by UG/sub B/(n, m) is defined to be the undirected version of G/sub B/(n, m) obtained by replacing each arc by an undirected edge and eliminating self-loops and multi-edges. In this paper we show that the diameter of UG/sub B/(n, m) is 2 for any m in [n+1, n/sup 2/] where n divides m and that the diameter is 3 for any m in [n/sup 2/+1, n/sup 3/] where n divides m.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data structures for one-dimensional packet classification using most-specific-rule matching Optimal multicast tree routing for cluster computing in hypercube interconnection networks An overview of data replication on the Internet Fault-tolerant routing on the star graph with safety vectors Automatic processor lower bound formulas for array computations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1