图中的支配函数-规则与不规则

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS
James Hallas, Maria Talanda-Fisher, Ping Zhang
{"title":"图中的支配函数-规则与不规则","authors":"James Hallas, Maria Talanda-Fisher, Ping Zhang","doi":"10.1080/23799927.2020.1762744","DOIUrl":null,"url":null,"abstract":"A vertex v in a graph G is said to dominate a vertex u if either u = v or and a set S of vertices in G is a dominating set of G if every vertex of G is dominated by at least one vertex in S. Domination has been looked at in an equivalent way. A function is a dominating function of a graph G if for every vertex v of G. We use dominating functions to investigate graphs all of whose vertices are dominated by the same number of vertices as well as those graphs whose vertices are dominated by as many different number of vertices as possible.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Dominating functions in graphs – regularity versus irregularity\",\"authors\":\"James Hallas, Maria Talanda-Fisher, Ping Zhang\",\"doi\":\"10.1080/23799927.2020.1762744\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A vertex v in a graph G is said to dominate a vertex u if either u = v or and a set S of vertices in G is a dominating set of G if every vertex of G is dominated by at least one vertex in S. Domination has been looked at in an equivalent way. A function is a dominating function of a graph G if for every vertex v of G. We use dominating functions to investigate graphs all of whose vertices are dominated by the same number of vertices as well as those graphs whose vertices are dominated by as many different number of vertices as possible.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2020-04-02\",\"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.2020.1762744\",\"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.2020.1762744","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

摘要

如果u = v或,则图G中的顶点v被称为支配顶点u,如果G中的每个顶点都被S中的至少一个顶点支配,则G中的顶点集S就是G的支配集。一个函数是图G的支配函数,如果对于G的每个顶点v,我们使用支配函数来研究所有顶点由相同数量的顶点控制的图,以及那些顶点由尽可能多的不同数量的顶点控制的图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dominating functions in graphs – regularity versus irregularity
A vertex v in a graph G is said to dominate a vertex u if either u = v or and a set S of vertices in G is a dominating set of G if every vertex of G is dominated by at least one vertex in S. Domination has been looked at in an equivalent way. A function is a dominating function of a graph G if for every vertex v of G. We use dominating functions to investigate graphs all of whose vertices are dominated by the same number of vertices as well as those graphs whose vertices are dominated by as many different number of vertices as possible.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信