增强超立方体中的不相交路径

Yanjuan Zhang, Hongmei Liu
{"title":"增强超立方体中的不相交路径","authors":"Yanjuan Zhang, Hongmei Liu","doi":"10.1109/ISME.2010.82","DOIUrl":null,"url":null,"abstract":"This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n, k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n+1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}. This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n,k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n + 1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}.","PeriodicalId":348878,"journal":{"name":"2010 International Conference of Information Science and Management Engineering","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Disjoint Paths in Enhanced Hypercube\",\"authors\":\"Yanjuan Zhang, Hongmei Liu\",\"doi\":\"10.1109/ISME.2010.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n, k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n+1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}. This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n,k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n + 1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}.\",\"PeriodicalId\":348878,\"journal\":{\"name\":\"2010 International Conference of Information Science and Management Engineering\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference of Information Science and Management Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISME.2010.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference of Information Science and Management Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISME.2010.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文的目的是研究Q_{n,2}中的内不相交路径。为此,Q_{n, k}(1 ≤k & # x2264;N)被详细调查。增强超立方体Q_{n,k}分区的相关性质。根据结果发现,对于任意两个不同的顶点x和y,存在n+1条内部不相交的路径连接x和y,该路径遍历Q_{n,2}的所有顶点。本文的目的是研究Q_{n,2}中的内不相交路径。为此,Q_{n,k}(1 ≤k & # x2264;N)被详细调查。增强超立方体Q_{n,k}分区的相关性质。根据结果发现,对于任意两个不同的顶点x和y,存在n + 1条内部不相交的路径连接x和y,该路径遍历Q_{n,2}的所有顶点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Disjoint Paths in Enhanced Hypercube
This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n, k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n+1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}. This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n,k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n + 1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信