一些凸多面体图的容错可分解性

IF 0.3 Q4 MATHEMATICS, APPLIED
S. Sharma, H. Raza, V. K. Bhat
{"title":"一些凸多面体图的容错可分解性","authors":"S. Sharma, H. Raza, V. K. Bhat","doi":"10.1515/dma-2023-0016","DOIUrl":null,"url":null,"abstract":"Abstract The fault-tolerant resolvability is an extension of metric resolvability in graphs with several intelligent systems applications, for example, network optimization, robot navigation, and sensor networking. The graphs of convex polytopes, which are rotationally symmetric, are essential in intelligent networks due to the uniform rate of data transformation to all nodes. A resolving set is an ordered set 𝕎 of vertices of a connected graph G in which the vector of distances to the vertices in 𝕎 uniquely determines all the vertices of the graph G. The minimum cardinality of a resolving set of G is known as the metric dimension of G. If 𝕎 ∖ ρ is also a resolving set for each ρ in 𝕎. In that case, 𝕎 is said to be a fault-tolerant resolving set. The fault-tolerant metric dimension of G is the minimum cardinality of such a set 𝕎. The metric dimension and the fault-tolerant metric dimension for three families of convex polytope graphs are studied. Our main results affirm that three families, as mentioned above, have constant fault-tolerant resolvability structures.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"33 1","pages":"177 - 187"},"PeriodicalIF":0.3000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fault-tolerant resolvability of some graphs of convex polytopes\",\"authors\":\"S. Sharma, H. Raza, V. K. Bhat\",\"doi\":\"10.1515/dma-2023-0016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The fault-tolerant resolvability is an extension of metric resolvability in graphs with several intelligent systems applications, for example, network optimization, robot navigation, and sensor networking. The graphs of convex polytopes, which are rotationally symmetric, are essential in intelligent networks due to the uniform rate of data transformation to all nodes. A resolving set is an ordered set 𝕎 of vertices of a connected graph G in which the vector of distances to the vertices in 𝕎 uniquely determines all the vertices of the graph G. The minimum cardinality of a resolving set of G is known as the metric dimension of G. If 𝕎 ∖ ρ is also a resolving set for each ρ in 𝕎. In that case, 𝕎 is said to be a fault-tolerant resolving set. The fault-tolerant metric dimension of G is the minimum cardinality of such a set 𝕎. The metric dimension and the fault-tolerant metric dimension for three families of convex polytope graphs are studied. Our main results affirm that three families, as mentioned above, have constant fault-tolerant resolvability structures.\",\"PeriodicalId\":11287,\"journal\":{\"name\":\"Discrete Mathematics and Applications\",\"volume\":\"33 1\",\"pages\":\"177 - 187\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/dma-2023-0016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2023-0016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1

摘要

容错可解析性是度量可解析性在图中的扩展,在网络优化、机器人导航和传感器网络等智能系统中有广泛的应用。由于数据到所有节点的转换速率一致,凸多面体图是旋转对称的,在智能网络中是必不可少的。解析集是连通图G的顶点的有序集,其中到顶点的距离向量唯一地决定了图G的所有顶点。G的解析集的最小基数被称为G的度量维数。如果∈ρ也是中每个ρ的解析集。在这种情况下,说它是一个容错解析集。G的容错度量维数是这样一个集合的最小基数。研究了三种凸多面体图族的度量维数和容错度量维数。我们的主要结果证实,如上所述,三个家庭具有恒定的容错可解性结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fault-tolerant resolvability of some graphs of convex polytopes
Abstract The fault-tolerant resolvability is an extension of metric resolvability in graphs with several intelligent systems applications, for example, network optimization, robot navigation, and sensor networking. The graphs of convex polytopes, which are rotationally symmetric, are essential in intelligent networks due to the uniform rate of data transformation to all nodes. A resolving set is an ordered set 𝕎 of vertices of a connected graph G in which the vector of distances to the vertices in 𝕎 uniquely determines all the vertices of the graph G. The minimum cardinality of a resolving set of G is known as the metric dimension of G. If 𝕎 ∖ ρ is also a resolving set for each ρ in 𝕎. In that case, 𝕎 is said to be a fault-tolerant resolving set. The fault-tolerant metric dimension of G is the minimum cardinality of such a set 𝕎. The metric dimension and the fault-tolerant metric dimension for three families of convex polytope graphs are studied. Our main results affirm that three families, as mentioned above, have constant fault-tolerant resolvability structures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.60
自引率
20.00%
发文量
29
期刊介绍: The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信