Reliability Analysis of the Cayley Graphs of Dihedral Groups*

IF 5.2 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Tsinghua Science and Technology Pub Date : 2011-02-01 DOI:10.1016/S1007-0214(11)70006-2
Song Shujiao (宋淑娇), Wang Dianjun (王殿军)
{"title":"Reliability Analysis of the Cayley Graphs of Dihedral Groups*","authors":"Song Shujiao (宋淑娇),&nbsp;Wang Dianjun (王殿军)","doi":"10.1016/S1007-0214(11)70006-2","DOIUrl":null,"url":null,"abstract":"<div><p>Cayley graphs have many good properties as models of communication networks. This study analyzes the reliability of the Cayley graph based on the dihedral graph. Graph theory and analyses show that almost all Cayley graphs of the dihedral graph <em>D</em><sub>2<em>n</em></sub> are optimal super-λ. The number <em>N<sub>i</sub>(G)</em> of cutsets of size <em>i</em>,λ≤<em>i</em>≤λ′ is given as\n<span><math><mrow><msub><mi>N</mi><mi>i</mi></msub><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>n</mi><mrow><mo>(</mo><mrow><mtable><mtr><mtd><mrow><mo>(</mo><mi>G</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></mtd></mtr><mtr><mtd><mrow><mi>i</mi><mo>−</mo><mi>δ</mi></mrow></mtd></mtr></mtable></mrow><mo>)</mo></mrow><mo>.</mo></mrow></math></span></p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2011-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70006-2","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1007021411700062","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

Abstract

Cayley graphs have many good properties as models of communication networks. This study analyzes the reliability of the Cayley graph based on the dihedral graph. Graph theory and analyses show that almost all Cayley graphs of the dihedral graph D2n are optimal super-λ. The number Ni(G) of cutsets of size i,λ≤i≤λ′ is given as Ni(G)=n((G1)iδ).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二面体群的Cayley图的可靠性分析*
凯利图作为通信网络的模型具有许多优良的性质。本文基于二面体图分析了Cayley图的可靠性。图论和分析表明,几乎所有的二面体图D2n的Cayley图都是最优的超λ。λ≤i≤λ '的切集的个数Ni(G)为Ni(G)=n((G−1)i−δ)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
12.10
自引率
0.00%
发文量
2340
期刊最新文献
GSM Co-Channel and Adjacent Channel Interference Analysis and Optimization An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction Optimal Power Control for OFDM Signals over Two-Way Relay with Physical Network Coding Efficient Algorithm for Prolonging Network Lifetime of Wireless Sensor Networks Guest Editorial: Special Issue on Wireless Sensor Networks, Cyber-Physical Systems, and Internet of Things
×
引用
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