Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment

IF 10.7 2区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Artificial Intelligence Review Pub Date : 2022-01-10 DOI:10.1007/s10462-021-10111-2

Soumitra Poulik, Ganesh Ghorai

{"title":"Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment","authors":"Soumitra Poulik, Ganesh Ghorai","doi":"10.1007/s10462-021-10111-2","DOIUrl":null,"url":null,"abstract":"<div><p>Connectivity and strength has a major role in the field of network connecting with real world life. Complexity function is one of these parameter which has manifold number of applications in molecular chemistry and the theory of network. Firstly, this paper introduces the thought of complexity function of fuzzy graph with its properties. Second, based on the highest and lowest load on a network system, the boundaries of complexity function of different types of fuzzy graphs are established. Third, the behavior of complexity function in fuzzy cycle, fuzzy tree and complete fuzzy graph are discussed with their properties. Fourth, applications of these thoughts are bestowed to identify the most effected COVID-19 cycles between some communicated countries using the concept of complexity function of fuzzy graph. Also the selection of the busiest network stations and connected internet paths can be done using the same concept in a graphical wireless network system.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"55 6","pages":"4557 - 4574"},"PeriodicalIF":10.7000,"publicationDate":"2022-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-021-10111-2.pdf","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-021-10111-2","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 10

Abstract

Connectivity and strength has a major role in the field of network connecting with real world life. Complexity function is one of these parameter which has manifold number of applications in molecular chemistry and the theory of network. Firstly, this paper introduces the thought of complexity function of fuzzy graph with its properties. Second, based on the highest and lowest load on a network system, the boundaries of complexity function of different types of fuzzy graphs are established. Third, the behavior of complexity function in fuzzy cycle, fuzzy tree and complete fuzzy graph are discussed with their properties. Fourth, applications of these thoughts are bestowed to identify the most effected COVID-19 cycles between some communicated countries using the concept of complexity function of fuzzy graph. Also the selection of the busiest network stations and connected internet paths can be done using the same concept in a graphical wireless network system.

Abstract Image

查看原文本刊更多论文

模糊环境下基于图复杂度函数的最受影响周期和最繁忙网络路由估计

在连接现实生活的网络领域，连接性和强度具有重要作用。复杂度函数是其中的一个参数，在分子化学和网络理论中有着广泛的应用。本文首先介绍了模糊图的复杂性函数思想及其性质。其次，根据网络系统的最高和最低负荷，建立不同类型模糊图的复杂度函数边界;第三，讨论了复杂性函数在模糊循环、模糊树和完全模糊图中的行为及其性质。第四，运用模糊图的复杂性函数概念，将这些思想应用于识别一些通信国家之间受影响最大的COVID-19周期。此外，在图形无线网络系统中，也可以使用相同的概念来选择最繁忙的网络站点和连接的互联网路径。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Artificial Intelligence Review 工程技术-计算机：人工智能

CiteScore

22.00

自引率

3.30%

发文量

194

审稿时长

5.3 months

期刊介绍： Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.