多数人在图表上双重罗马统治

IF 0.6 Q4 MATHEMATICS, APPLIED

Discrete Mathematics Algorithms and Applications Pub Date : 2023-10-06 DOI:10.1142/s1793830923500817

S. Anandha Prabhavathy, I. Sahul Hamid

{"title":"多数人在图表上双重罗马统治","authors":"S. Anandha Prabhavathy, I. Sahul Hamid","doi":"10.1142/s1793830923500817","DOIUrl":null,"url":null,"abstract":"A majority double Roman dominating function (MDRDF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices assigned with 2 or to at least one vertex [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text] and (iii) [Formula: see text], for at least half of the vertices in [Formula: see text]. The weight of an MDRDF is the sum of its function values over all vertices. The majority double Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text]. In this paper, we introduce and study the majority double Roman domination number on some classes of graphs.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Majority double Roman domination in graphs\",\"authors\":\"S. Anandha Prabhavathy, I. Sahul Hamid\",\"doi\":\"10.1142/s1793830923500817\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A majority double Roman dominating function (MDRDF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices assigned with 2 or to at least one vertex [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text] and (iii) [Formula: see text], for at least half of the vertices in [Formula: see text]. The weight of an MDRDF is the sum of its function values over all vertices. The majority double Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text]. In this paper, we introduce and study the majority double Roman domination number on some classes of graphs.\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-06\",\"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/s1793830923500817\",\"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/s1793830923500817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

多数双罗马控制函数(MDRDF)图(公式:看到文本)是一个函数(公式:看到文本),(我)每个顶点(公式:看到文本)与公式:看到文本是相邻的至少两个顶点分配2或至少一个顶点(公式:看到文本)(公式:看到文本),(2)每个顶点(公式:看到文本)与公式:看到文本是相邻的至少一个顶点(公式:看到文本)(公式:看到文本)和(iii)[公式:[公式:见文本]中至少一半的顶点。MDRDF的权值是其所有顶点上的函数值之和。图[公式:见文]的多数双罗马支配数，用[公式:见文]表示，定义为[公式:见文]。本文引入并研究了几类图的多数双罗马支配数。

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

查看原文本刊更多论文

Majority double Roman domination in graphs

A majority double Roman dominating function (MDRDF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices assigned with 2 or to at least one vertex [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text] and (iii) [Formula: see text], for at least half of the vertices in [Formula: see text]. The weight of an MDRDF is the sum of its function values over all vertices. The majority double Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text]. In this paper, we introduce and study the majority double Roman domination number on some classes of graphs.

求助全文

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

来源期刊

Discrete Mathematics Algorithms and Applications MATHEMATICS, APPLIED-

CiteScore

1.50

自引率

41.70%

发文量

129