{"title":"关于线形图的局部度量维数","authors":"Chenxu Yang, Xingchao Deng, Wen Li","doi":"10.1142/s0219265923500263","DOIUrl":null,"url":null,"abstract":"Let [Formula: see text] be a graph. For any [Formula: see text], if there exists [Formula: see text] such that [Formula: see text], we say that [Formula: see text] resolving [Formula: see text]. A set [Formula: see text] of vertices in [Formula: see text] is a local resolving set of [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] for any [Formula: see text]. The local metric dimension [Formula: see text] of [Formula: see text] is the minimum cardinality of all the local resolving sets of [Formula: see text]. In this paper, we study the relation between [Formula: see text] and [Formula: see text]. Furthermore, we construct a graph [Formula: see text] such that [Formula: see text] and [Formula: see text]. Finally, we investigate the local metric dimension of several special line graphs.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"52 8","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Local Metric Dimension of Line Graphs\",\"authors\":\"Chenxu Yang, Xingchao Deng, Wen Li\",\"doi\":\"10.1142/s0219265923500263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let [Formula: see text] be a graph. For any [Formula: see text], if there exists [Formula: see text] such that [Formula: see text], we say that [Formula: see text] resolving [Formula: see text]. A set [Formula: see text] of vertices in [Formula: see text] is a local resolving set of [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] for any [Formula: see text]. The local metric dimension [Formula: see text] of [Formula: see text] is the minimum cardinality of all the local resolving sets of [Formula: see text]. In this paper, we study the relation between [Formula: see text] and [Formula: see text]. Furthermore, we construct a graph [Formula: see text] such that [Formula: see text] and [Formula: see text]. Finally, we investigate the local metric dimension of several special line graphs.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"52 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265923500263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265923500263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Let [Formula: see text] be a graph. For any [Formula: see text], if there exists [Formula: see text] such that [Formula: see text], we say that [Formula: see text] resolving [Formula: see text]. A set [Formula: see text] of vertices in [Formula: see text] is a local resolving set of [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] for any [Formula: see text]. The local metric dimension [Formula: see text] of [Formula: see text] is the minimum cardinality of all the local resolving sets of [Formula: see text]. In this paper, we study the relation between [Formula: see text] and [Formula: see text]. Furthermore, we construct a graph [Formula: see text] such that [Formula: see text] and [Formula: see text]. Finally, we investigate the local metric dimension of several special line graphs.
期刊介绍:
The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.