Research on the Stability of Two Special Networks

Jianxiang Cao, Wenqian Shang, Weiguo Lin
{"title":"Research on the Stability of Two Special Networks","authors":"Jianxiang Cao, Wenqian Shang, Weiguo Lin","doi":"10.1109/DSA.2019.00088","DOIUrl":null,"url":null,"abstract":"It is known that the topological structure of an interconnection network can be modelled by a connected graph whose vertices represent sites of the network and whose edges represent the communication links. So many problems about networks can be converted to the study of graphs. The domination number of graphs is an important parameter and it has been used to measure the robustness of an interconnection network. But it has been proved that calculating the domination number of graph is a NP-complete problem, and it is also difficult to give the better boundary domination number of the graph, we only can calculate some special graphs which have some special structure. In this paper we consider the domination number of two special networks.","PeriodicalId":342719,"journal":{"name":"2019 6th International Conference on Dependable Systems and Their Applications (DSA)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 6th International Conference on Dependable Systems and Their Applications (DSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSA.2019.00088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is known that the topological structure of an interconnection network can be modelled by a connected graph whose vertices represent sites of the network and whose edges represent the communication links. So many problems about networks can be converted to the study of graphs. The domination number of graphs is an important parameter and it has been used to measure the robustness of an interconnection network. But it has been proved that calculating the domination number of graph is a NP-complete problem, and it is also difficult to give the better boundary domination number of the graph, we only can calculate some special graphs which have some special structure. In this paper we consider the domination number of two special networks.
两种特殊网络的稳定性研究
众所周知,互连网络的拓扑结构可以用连通图来建模,连通图的顶点表示网络的站点,其边表示通信链路。很多关于网络的问题都可以转化为对图的研究。图的支配数是衡量互连网络鲁棒性的一个重要参数。但是已经证明计算图的边界控制数是一个np完全问题,而且很难给出图的更好的边界控制数,我们只能计算一些具有特殊结构的特殊图。本文考虑了两个特殊网络的控制数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信