用更多的军团来扩大罗马的统治

IF 0.6 Q4 MATHEMATICS, APPLIED

Discrete Mathematics Algorithms and Applications Pub Date : 2022-12-17 DOI:10.1142/s1793830923500040

Fahimeh Khosh-Ahang Ghasr

{"title":"用更多的军团来扩大罗马的统治","authors":"Fahimeh Khosh-Ahang Ghasr","doi":"10.1142/s1793830923500040","DOIUrl":null,"url":null,"abstract":"In this note, we generalize the concepts of (perfect) Roman and Italian dominations to (perfect) strong Roman and Roman k-domination for arbitrary positive integer k. These generalizations cover some of previous ones. After some comparison of their domination numbers, as a first study of these concepts, we study the (perfect, strong, perfect strong) Roman k-domination numbers of complete bipartite graphs.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"35 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On a generalization of roman domination with more legions\",\"authors\":\"Fahimeh Khosh-Ahang Ghasr\",\"doi\":\"10.1142/s1793830923500040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this note, we generalize the concepts of (perfect) Roman and Italian dominations to (perfect) strong Roman and Roman k-domination for arbitrary positive integer k. These generalizations cover some of previous ones. After some comparison of their domination numbers, as a first study of these concepts, we study the (perfect, strong, perfect strong) Roman k-domination numbers of complete bipartite graphs.\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830923500040\",\"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 Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830923500040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们将(完全)罗马和意大利支配的概念推广到任意正整数k的(完全)强罗马和罗马k支配。这些推广涵盖了之前的一些推广。在比较了它们的支配数之后，作为对这些概念的第一次研究，我们研究了完全二部图的(完全，强，完全强)罗马k-支配数。

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

查看原文本刊更多论文

On a generalization of roman domination with more legions

In this note, we generalize the concepts of (perfect) Roman and Italian dominations to (perfect) strong Roman and Roman k-domination for arbitrary positive integer k. These generalizations cover some of previous ones. After some comparison of their domination numbers, as a first study of these concepts, we study the (perfect, strong, perfect strong) Roman k-domination numbers of complete bipartite graphs.

求助全文

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

来源期刊

Discrete Mathematics Algorithms and Applications MATHEMATICS, APPLIED-

CiteScore

1.50

自引率

41.70%

发文量

129