Computing the (forcing) strong metric dimension in strongly annihilating-ideal graphs

IF 0.6 4区 工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-04-22 DOI:10.1007/s00200-023-00601-x
M. Pazoki, R. Nikandish
{"title":"Computing the (forcing) strong metric dimension in strongly annihilating-ideal graphs","authors":"M. Pazoki,&nbsp;R. Nikandish","doi":"10.1007/s00200-023-00601-x","DOIUrl":null,"url":null,"abstract":"<div><p>The strongly annihilating-ideal graph <span>\\(\\textrm{SAG}(R)\\)</span> of a commutative unital ring <i>R</i> is a simple graph whose vertices are non-zero ideals of <i>R</i> with non-zero annihilator and there exists an edge between two distinct vertices if and only if each of them has a non-zero intersection with annihilator of the other one. In this paper, we compute twin-free clique number of <span>\\(\\textrm{SAG}(R)\\)</span> and as an application strong metric dimension of <span>\\(\\textrm{SAG}(R)\\)</span> is given. Moreover, we investigate the structures of strong resolving sets in <span>\\(\\textrm{SAG}(R)\\)</span> to find forcing strong metric dimension in <span>\\(\\textrm{SAG}(R)\\)</span>.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"36 2","pages":"273 - 283"},"PeriodicalIF":0.6000,"publicationDate":"2023-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-023-00601-x.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-023-00601-x","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The strongly annihilating-ideal graph \(\textrm{SAG}(R)\) of a commutative unital ring R is a simple graph whose vertices are non-zero ideals of R with non-zero annihilator and there exists an edge between two distinct vertices if and only if each of them has a non-zero intersection with annihilator of the other one. In this paper, we compute twin-free clique number of \(\textrm{SAG}(R)\) and as an application strong metric dimension of \(\textrm{SAG}(R)\) is given. Moreover, we investigate the structures of strong resolving sets in \(\textrm{SAG}(R)\) to find forcing strong metric dimension in \(\textrm{SAG}(R)\).

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
强湮灭理想图中强度量维数的计算
交换一元环R的强湮灭理想图\(\textrm{SAG}(R)\)是一个简单图,它的顶点是具有非零湮灭子的R的非零理想,并且当且仅当两个不同的顶点与另一个的湮灭子有非零相交时,它们之间存在一条边。本文计算了\(\textrm{SAG}(R)\)的无双团数,并给出了\(\textrm{SAG}(R)\)的强度量维数作为应用。此外,我们研究了\(\textrm{SAG}(R)\)中的强解析集的结构,以找到\(\textrm{SAG}(R)\)中的强制强度量维。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applicable Algebra in Engineering Communication and Computing
Applicable Algebra in Engineering Communication and Computing 工程技术-计算机:跨学科应用
CiteScore
2.90
自引率
14.30%
发文量
48
审稿时长
>12 weeks
期刊介绍: Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.
期刊最新文献
Best Paper Award in Memory of Jacques Calmet Correction: In memoriam Kai-Uwe Schmidt Best Paper Award in Memory of Jacques Calmet Call for Papers: Special Issue of AAECC Dedicated to the Memory of Joos Heintz Security assessment of the LG cryptosystem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1