Edge-Neighbor Rupture Degree on Graph Operations

Saadet Eskiizmirliler, Z. Yorgancioglu
{"title":"Edge-Neighbor Rupture Degree on Graph Operations","authors":"Saadet Eskiizmirliler, Z. Yorgancioglu","doi":"10.5121/MATHSJ.2018.5301","DOIUrl":null,"url":null,"abstract":"Vulnerability and reliability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links in a communication network. An edge subversion strategy of a graph , say , is a set of edge(s) in whose adjacent vertices which is incident with the removal edge(s) are removed from . The survival subgraph is denoted by − . The edgeneighbor-rupture degree of connected graph , , is defined to be = − − | | − − : ⊆ , − ≥ 1 where is any edge-cut-strategy of , − is the number of the components of − , and − is the maximum order of the components of − . In this paper we give some results for the edge-neighbor-rupture degree of the graph operations and Thorny graph types are examined.","PeriodicalId":151714,"journal":{"name":"Applied Mathematics and Sciences: An International Journal (MathSJ)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Sciences: An International Journal (MathSJ)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/MATHSJ.2018.5301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Vulnerability and reliability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links in a communication network. An edge subversion strategy of a graph , say , is a set of edge(s) in whose adjacent vertices which is incident with the removal edge(s) are removed from . The survival subgraph is denoted by − . The edgeneighbor-rupture degree of connected graph , , is defined to be = − − | | − − : ⊆ , − ≥ 1 where is any edge-cut-strategy of , − is the number of the components of − , and − is the maximum order of the components of − . In this paper we give some results for the edge-neighbor-rupture degree of the graph operations and Thorny graph types are examined.
图运算的边邻破裂度
脆弱性和可靠性参数衡量的是在通信网络中某些站点或通信链路发生故障后,网络对中断运行的抵抗力。例如,图的边缘颠覆策略是一组边缘,其中与移除边缘相关的相邻顶点被移除。生存子图用−表示。连通图的边邻破裂度定义为=−−| |−−:,−≥1,其中为的任意边切策略,−为−的分量的个数,−为−的分量的最大阶数。本文给出了图运算的边邻破裂度的一些结果,并对棘手图的类型进行了检验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信