图中的不规则轨道支配

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS
Peter Broe, G. Chartrand, Ping Zhang
{"title":"图中的不规则轨道支配","authors":"Peter Broe, G. Chartrand, Ping Zhang","doi":"10.1080/23799927.2021.2014977","DOIUrl":null,"url":null,"abstract":"For a non-negative integer r, the r-orbit of a vertex v in a connected graph G of order n is the set of vertices at distance r from v. A sequence of positive integers with is called an irregular orbital dominating sequence of G if for every pair i, j of integers with and G contains distinct vertices such that We investigate graphs that possess and graphs do not possess an irregular orbital dominating sequence. It is shown that a non-trivial tree has an irregular orbital dominating sequence if and only if it is neither a star, a path of order 2, nor a path of order 6.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2021-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Irregular orbital domination in graphs\",\"authors\":\"Peter Broe, G. Chartrand, Ping Zhang\",\"doi\":\"10.1080/23799927.2021.2014977\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a non-negative integer r, the r-orbit of a vertex v in a connected graph G of order n is the set of vertices at distance r from v. A sequence of positive integers with is called an irregular orbital dominating sequence of G if for every pair i, j of integers with and G contains distinct vertices such that We investigate graphs that possess and graphs do not possess an irregular orbital dominating sequence. It is shown that a non-trivial tree has an irregular orbital dominating sequence if and only if it is neither a star, a path of order 2, nor a path of order 6.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2021.2014977\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2021.2014977","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 4

摘要

对于非负整数r, n阶连通图G中顶点v的r轨道是距离v r处的顶点集合。如果对于每一对整数i, j和G包含不同的顶点,我们研究具有和不具有不规则轨道支配序列的图,则具有的正整数序列称为G的不规则轨道支配序列。证明了非平凡树具有不规则轨道支配序列当且仅当它既不是恒星,也不是2阶路径,也不是6阶路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Irregular orbital domination in graphs
For a non-negative integer r, the r-orbit of a vertex v in a connected graph G of order n is the set of vertices at distance r from v. A sequence of positive integers with is called an irregular orbital dominating sequence of G if for every pair i, j of integers with and G contains distinct vertices such that We investigate graphs that possess and graphs do not possess an irregular orbital dominating sequence. It is shown that a non-trivial tree has an irregular orbital dominating sequence if and only if it is neither a star, a path of order 2, nor a path of order 6.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
×
引用
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学术官方微信