基础设施网络的差异

IF 1.8 4区管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Rairo-Operations Research Pub Date : 2020-03-19 DOI:10.1051/ro/2020032

Akın Kanli, Zeynep Nihan Berberler

{"title":"基础设施网络的差异","authors":"Akın Kanli, Zeynep Nihan Berberler","doi":"10.1051/ro/2020032","DOIUrl":null,"url":null,"abstract":"Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \\ D that have a neighbor in the vertex set D. The differential of a vertex set D is defined as ∂(D) = |B(D)| − |D| and the maximum value of ∂(D) for any subset D of V is the differential of G. A set D of vertices of a graph G is said to be a dominating set if every vertex in V \\ D is adjacent to a vertex in D. G is a dominant differential graph if it contains a ∂-set which is also a dominating set. This paper is devoted to the computation of differential of wheel, cycle and path-related graphs as infrastructure networks. Furthermore, dominant differential wheel, cycle and path-related types of networks are recognized.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"9 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Differential in infrastructure networks\",\"authors\":\"Akın Kanli, Zeynep Nihan Berberler\",\"doi\":\"10.1051/ro/2020032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \\\\ D that have a neighbor in the vertex set D. The differential of a vertex set D is defined as ∂(D) = |B(D)| − |D| and the maximum value of ∂(D) for any subset D of V is the differential of G. A set D of vertices of a graph G is said to be a dominating set if every vertex in V \\\\ D is adjacent to a vertex in D. G is a dominant differential graph if it contains a ∂-set which is also a dominating set. This paper is devoted to the computation of differential of wheel, cycle and path-related graphs as infrastructure networks. Furthermore, dominant differential wheel, cycle and path-related types of networks are recognized.\",\"PeriodicalId\":54509,\"journal\":{\"name\":\"Rairo-Operations Research\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2020-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Rairo-Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2020032\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Rairo-Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1051/ro/2020032","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 2

摘要

让G = (V, E)是n的图,让B (D)是一组顶点V \ D有邻居顶点集的顶点集D的微分的定义是∂(D) = | B (D) |−| |和∂的最大值(D)的任何子集D G的微分是一组D图G的顶点是一组控制如果每个顶点V \ D是相邻的顶点D G是一个占主导地位的微分图如果它包含∂组也是一个支配集。本文研究了车轮、循环和路径相关图作为基础网络的微分计算。此外，还识别了主要的差动轮、循环和路径相关网络类型。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Differential in infrastructure networks

Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighbor in the vertex set D. The differential of a vertex set D is defined as ∂(D) = |B(D)| − |D| and the maximum value of ∂(D) for any subset D of V is the differential of G. A set D of vertices of a graph G is said to be a dominating set if every vertex in V \ D is adjacent to a vertex in D. G is a dominant differential graph if it contains a ∂-set which is also a dominating set. This paper is devoted to the computation of differential of wheel, cycle and path-related graphs as infrastructure networks. Furthermore, dominant differential wheel, cycle and path-related types of networks are recognized.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Rairo-Operations Research 管理科学-运筹学与管理科学

CiteScore

3.60

自引率

22.20%

发文量

206

审稿时长

>12 weeks

期刊介绍： RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.