{"title":"Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications","authors":"Zengtai Gong, Lele He","doi":"10.1142/s0129054123500223","DOIUrl":null,"url":null,"abstract":"The connectivity is one of the crucial parameters of network used to transport network flow, routing problems and bandwidth allocation problems. The increased connectivity makes a network more stable. In this paper, a new parameter called connectivity status of a vertex is introduced in the intuitionistic fuzzy graph. The related definitions and propositions of connectivity status of a vertex are proposed and investigated in an intuitionistic fuzzy graph. Specifically, connectivity status and status sequence are defined and analysed with various examples. After deleting a vertex, we classify the vertices of an intuitionistic fuzzy graph as connectivity status enhancing vertices, connectivity status neutral vertices and connectivity status reducing vertices because of the change of connectivity status. Finally, we establish two algorithms for these concepts and give an application to illustrate feasibility of algorithms.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054123500223","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The connectivity is one of the crucial parameters of network used to transport network flow, routing problems and bandwidth allocation problems. The increased connectivity makes a network more stable. In this paper, a new parameter called connectivity status of a vertex is introduced in the intuitionistic fuzzy graph. The related definitions and propositions of connectivity status of a vertex are proposed and investigated in an intuitionistic fuzzy graph. Specifically, connectivity status and status sequence are defined and analysed with various examples. After deleting a vertex, we classify the vertices of an intuitionistic fuzzy graph as connectivity status enhancing vertices, connectivity status neutral vertices and connectivity status reducing vertices because of the change of connectivity status. Finally, we establish two algorithms for these concepts and give an application to illustrate feasibility of algorithms.
期刊介绍：
The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include:
- Algebraic theory of computing and formal systems
- Algorithm and system implementation issues
- Approximation, probabilistic, and randomized algorithms
- Automata and formal languages
- Automated deduction
- Combinatorics and graph theory
- Complexity theory
- Computational biology and bioinformatics
- Cryptography
- Database theory
- Data structures
- Design and analysis of algorithms
- DNA computing
- Foundations of computer security
- Foundations of high-performance computing
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
