论图形的局部度量维度

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-01-10 DOI:10.1142/s0219265923500330

Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu

{"title":"论图形的局部度量维度","authors":"Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu","doi":"10.1142/s0219265923500330","DOIUrl":null,"url":null,"abstract":"Let [Formula: see text] be a graph. A set [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 characterize the graphs with [Formula: see text]. Next, we obtain the Nordhaus–Gaddum-type results for local metric dimension. Finally, the local metric dimension of several graph classes is given.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"1 2","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Local Metric Dimension of Graphs\",\"authors\":\"Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu\",\"doi\":\"10.1142/s0219265923500330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let [Formula: see text] be a graph. A set [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 characterize the graphs with [Formula: see text]. Next, we obtain the Nordhaus–Gaddum-type results for local metric dimension. Finally, the local metric dimension of several graph classes is given.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"1 2\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-01-10\",\"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/s0219265923500330\",\"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/s0219265923500330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

设[公式：见文本]是一个图。如果存在[公式：见文本]，使得任意[公式：见文本]的[公式：见文本]都是[公式：见文本]的局部解析集，那么集合[公式：见文本]就是[公式：见文本]的局部解析集。公式：见文本]的局部度量维度[公式：见文本]是[公式：见文本]所有局部解析集合的最小心数。在本文中，我们用[公式：见正文]来描述图的特征。接着，我们得到了关于局部度量维度的诺德豪斯-加登姆（Nordhaus-Gaddum）式结果。最后，我们给出了几类图的局部度量维度。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the Local Metric Dimension of Graphs

Let [Formula: see text] be a graph. A set [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 characterize the graphs with [Formula: see text]. Next, we obtain the Nordhaus–Gaddum-type results for local metric dimension. Finally, the local metric dimension of several graph classes is given.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-

自引率

14.30%

发文量

121

期刊介绍： 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.

期刊最新文献

On the Local Metric Dimension of Graphs Bounds of Two Toughnesses and Binding Numbers for Star Factors Some Existence Theorems on Star Factors Krill Herd and Feed Forward Optimization System-Based Routing Protocol for IoT-MANET Environment Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis