删除字典积下图的度量维数和防御k-联盟的界

IF 0.6 Q3 MATHEMATICS

Transactions on Combinatorics Pub Date : 2019-10-12 DOI:10.22108/TOC.2019.115674.1622

K. Das, M. Tavakoli

{"title":"删除字典积下图的度量维数和防御k-联盟的界","authors":"K. Das, M. Tavakoli","doi":"10.22108/TOC.2019.115674.1622","DOIUrl":null,"url":null,"abstract":"‎Metric dimension and defensive $k$-alliance number are two distance-based graph invariants‎ ‎which have applications in robot navigation‎, ‎quantitative analysis of secondary RNA structures‎, ‎national defense and fault-tolerant computing‎. ‎In this paper‎, ‎some bounds for metric‎ ‎dimension and defensive $k$-alliance of deleted lexicographic product of graphs are presented‎. ‎We also show that the bounds are sharp‎.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"9 1","pages":"31-39"},"PeriodicalIF":0.6000,"publicationDate":"2019-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Bounds for metric dimension and defensive k-alliance of graphs under deleted lexicographic product\",\"authors\":\"K. Das, M. Tavakoli\",\"doi\":\"10.22108/TOC.2019.115674.1622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"‎Metric dimension and defensive $k$-alliance number are two distance-based graph invariants‎ ‎which have applications in robot navigation‎, ‎quantitative analysis of secondary RNA structures‎, ‎national defense and fault-tolerant computing‎. ‎In this paper‎, ‎some bounds for metric‎ ‎dimension and defensive $k$-alliance of deleted lexicographic product of graphs are presented‎. ‎We also show that the bounds are sharp‎.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"9 1\",\"pages\":\"31-39\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2019.115674.1622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2019.115674.1622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 2

摘要

‎度量维数和防御$k$-联盟数是两个基于距离的图不变量‎ ‎在机器人导航中有应用‎, ‎二级RNA结构的定量分析‎, ‎国防与容错计算‎. ‎在本文中‎, ‎度量的一些界‎ ‎给出了图的删除字典积的维数和防御$k$-联盟‎. ‎我们还证明了边界是尖锐的‎.

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

查看原文本刊更多论文

Bounds for metric dimension and defensive k-alliance of graphs under deleted lexicographic product

‎Metric dimension and defensive $k$-alliance number are two distance-based graph invariants‎ ‎which have applications in robot navigation‎, ‎quantitative analysis of secondary RNA structures‎, ‎national defense and fault-tolerant computing‎. ‎In this paper‎, ‎some bounds for metric‎ ‎dimension and defensive $k$-alliance of deleted lexicographic product of graphs are presented‎. ‎We also show that the bounds are sharp‎.

求助全文

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

来源期刊

Transactions on Combinatorics MATHEMATICS-

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

30 weeks