On the Local Metric Dimension of Line Graphs

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-10-31 DOI:10.1142/s0219265923500263
Chenxu Yang, Xingchao Deng, Wen Li
{"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于线形图的局部度量维数
设[公式:见文本]为图形。对于任何[公式:见文],如果存在[公式:见文]使得[公式:见文],我们说[公式:见文]消解[公式:见文]。如果存在[公式:见文本]使得[公式:见文本]对于任何[公式:见文本],[公式:见文本]的顶点集[公式:见文本]是[公式:见文本]的局部解析集。[公式:见文本]的局部度量维度[公式:见文本]是[公式:见文本]的所有局部解析集的最小基数。本文研究了[公式:见文]与[公式:见文]之间的关系。此外,我们构造了一个图[公式:见文],使得[公式:见文]和[公式:见文]。最后,我们研究了几种特殊线形图的局部度量维数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
JOURNAL OF INTERCONNECTION NETWORKS
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
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1