Faiza Jamil, Agha Kashif, Sohail Zafar, Michael Onyango Ojiema
{"title":"一类复杂网络的局部分数强度量维数","authors":"Faiza Jamil, Agha Kashif, Sohail Zafar, Michael Onyango Ojiema","doi":"10.1155/2023/3635342","DOIUrl":null,"url":null,"abstract":"<div>\n <p>Fractional variants of distance-based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems. Complex networks are exceptional networks which exhibit significant topological features and have become quintessential research area in the field of computer science, biology, and mathematics. Owing to the possibility that many real-world systems can be intelligently modeled and represented as complex networks to examine, administer and comprehend the useful information from these real-world networks. In this paper, local fractional strong metric dimension of certain complex networks is computed. Building blocks of complex networks are considered as the symmetric networks such as cyclic networks <i>C</i><sub><i>n</i></sub>, circulant networks <i>C</i><sub><i>n</i></sub>(1,2), mobious ladder networks <i>M</i><sub>2<i>n</i></sub>, and generalized prism networks <span></span><math></math>. In this regard, it is shown that LSFMD of <i>C</i><sub><i>n</i></sub>(<i>n</i> ≥ 3) and <span></span><math></math> is 1 when <i>n</i> is even and <i>n</i>/<i>n</i> − 1 when <i>n</i> is odd, whereas LSFMD of <i>M</i><sub>2<i>n</i></sub> is 1 when <i>n</i> is odd and <i>n</i>/<i>n</i> − 1 when <i>n</i> is even. Also, LSFMD of <i>C</i><sub><i>n</i></sub>(1,2) is <i>n</i>/2(⌈<i>m</i> + 1/2⌉) where <i>n</i> ≥ 6 and <i>m</i> = ⌈<i>n</i> − 5/4⌉.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2023 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/3635342","citationCount":"0","resultStr":"{\"title\":\"Local Fractional Strong Metric Dimension of Certain Complex Networks\",\"authors\":\"Faiza Jamil, Agha Kashif, Sohail Zafar, Michael Onyango Ojiema\",\"doi\":\"10.1155/2023/3635342\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>Fractional variants of distance-based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems. Complex networks are exceptional networks which exhibit significant topological features and have become quintessential research area in the field of computer science, biology, and mathematics. Owing to the possibility that many real-world systems can be intelligently modeled and represented as complex networks to examine, administer and comprehend the useful information from these real-world networks. In this paper, local fractional strong metric dimension of certain complex networks is computed. Building blocks of complex networks are considered as the symmetric networks such as cyclic networks <i>C</i><sub><i>n</i></sub>, circulant networks <i>C</i><sub><i>n</i></sub>(1,2), mobious ladder networks <i>M</i><sub>2<i>n</i></sub>, and generalized prism networks <span></span><math></math>. In this regard, it is shown that LSFMD of <i>C</i><sub><i>n</i></sub>(<i>n</i> ≥ 3) and <span></span><math></math> is 1 when <i>n</i> is even and <i>n</i>/<i>n</i> − 1 when <i>n</i> is odd, whereas LSFMD of <i>M</i><sub>2<i>n</i></sub> is 1 when <i>n</i> is odd and <i>n</i>/<i>n</i> − 1 when <i>n</i> is even. Also, LSFMD of <i>C</i><sub><i>n</i></sub>(1,2) is <i>n</i>/2(⌈<i>m</i> + 1/2⌉) where <i>n</i> ≥ 6 and <i>m</i> = ⌈<i>n</i> − 5/4⌉.</p>\\n </div>\",\"PeriodicalId\":50653,\"journal\":{\"name\":\"Complexity\",\"volume\":\"2023 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2023-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/3635342\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complexity\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/2023/3635342\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2023/3635342","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Local Fractional Strong Metric Dimension of Certain Complex Networks
Fractional variants of distance-based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems. Complex networks are exceptional networks which exhibit significant topological features and have become quintessential research area in the field of computer science, biology, and mathematics. Owing to the possibility that many real-world systems can be intelligently modeled and represented as complex networks to examine, administer and comprehend the useful information from these real-world networks. In this paper, local fractional strong metric dimension of certain complex networks is computed. Building blocks of complex networks are considered as the symmetric networks such as cyclic networks Cn, circulant networks Cn(1,2), mobious ladder networks M2n, and generalized prism networks . In this regard, it is shown that LSFMD of Cn(n ≥ 3) and is 1 when n is even and n/n − 1 when n is odd, whereas LSFMD of M2n is 1 when n is odd and n/n − 1 when n is even. Also, LSFMD of Cn(1,2) is n/2(⌈m + 1/2⌉) where n ≥ 6 and m = ⌈n − 5/4⌉.
期刊介绍:
Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.