星图的张成直径

Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu
{"title":"星图的张成直径","authors":"Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu","doi":"10.1109/ISPAN.2004.1300536","DOIUrl":null,"url":null,"abstract":"Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The spanning diameter of the star graphs\",\"authors\":\"Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu\",\"doi\":\"10.1109/ISPAN.2004.1300536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.\",\"PeriodicalId\":198404,\"journal\":{\"name\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2004.1300536\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

设u和v是S/sub n/的n/ spl ges/ 5的不同部集的任意两个不同的顶点。我们证明了存在(n - 1)条内部不相交路径P/下标1/,P/下标2/,…, P/下标n-i/将u与v连接,使得/spl cup//sup n = 1//下标i = 2/ P/下标i/跨出S/下标n/和l(P/下标i/) /spl les/ (n - 1)!+ 2(n - 2)!+ 2(n - 3)!+ 1 = n!/(n - 2) + 1。我们还证明了有两条内部不相交的路径Q/下标1/和Q/下标2/连接u和v,使得Q/下标1/ /spl cup/ Q/下标2/跨越S/下标n/和l(Q/下标i/) /spl les/ n!/2 + l对于I = 1,2。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The spanning diameter of the star graphs
Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Proxy placement in coordinated en-route transcoding caching for tree networks Optimal adaptive fault diagnosis of cubic Hamiltonian graphs The spanning diameter of the star graphs Particle swarm optimization algorithm in signal detection and blind extraction An approach to achieve message efficient early-stopping uniform consensus protocols
×
引用
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