{"title":"一类循环网络的局部度量维数","authors":"J. Cynthia, M. Ramya, S. Prabhu","doi":"10.20965/jaciii.2023.p0554","DOIUrl":null,"url":null,"abstract":"Let G(V,E) be a graph with a set of vertices V and a set of edges E. Then, a minimum subset Wl of V is said to be a local metric basis of G if for any two adjacent vertices u,v∈V∖Wl there exists a vertex w∈Wl such that d(u,w) ≠ d(v,w). The cardinality of a local metric basis is referred to as the local metric dimension of the graph G denoted by βl(G). In this paper, we investigate the local metric dimensions of certain circulant-related architectures such as Harary graphs Hk,n with even k or n, Toeplitz networks, and ILLIAC networks.","PeriodicalId":45921,"journal":{"name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","volume":"71 1","pages":"554-560"},"PeriodicalIF":0.7000,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Local Metric Dimension of Certain Classes of Circulant Networks\",\"authors\":\"J. Cynthia, M. Ramya, S. Prabhu\",\"doi\":\"10.20965/jaciii.2023.p0554\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G(V,E) be a graph with a set of vertices V and a set of edges E. Then, a minimum subset Wl of V is said to be a local metric basis of G if for any two adjacent vertices u,v∈V∖Wl there exists a vertex w∈Wl such that d(u,w) ≠ d(v,w). The cardinality of a local metric basis is referred to as the local metric dimension of the graph G denoted by βl(G). In this paper, we investigate the local metric dimensions of certain circulant-related architectures such as Harary graphs Hk,n with even k or n, Toeplitz networks, and ILLIAC networks.\",\"PeriodicalId\":45921,\"journal\":{\"name\":\"Journal of Advanced Computational Intelligence and Intelligent Informatics\",\"volume\":\"71 1\",\"pages\":\"554-560\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advanced Computational Intelligence and Intelligent Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20965/jaciii.2023.p0554\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Computational Intelligence and Intelligent Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20965/jaciii.2023.p0554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Local Metric Dimension of Certain Classes of Circulant Networks
Let G(V,E) be a graph with a set of vertices V and a set of edges E. Then, a minimum subset Wl of V is said to be a local metric basis of G if for any two adjacent vertices u,v∈V∖Wl there exists a vertex w∈Wl such that d(u,w) ≠ d(v,w). The cardinality of a local metric basis is referred to as the local metric dimension of the graph G denoted by βl(G). In this paper, we investigate the local metric dimensions of certain circulant-related architectures such as Harary graphs Hk,n with even k or n, Toeplitz networks, and ILLIAC networks.