代潇娜,张新鸿

• 1:太原科技大学应用科学学院

摘要(Abstract)：

如果有向图D中每个赋值为0的顶点至少有一个赋值为2的内邻点，则称函数f∶V(D)→{0,1,2}为D的一个罗马控制函数。有向图图D的罗马控制函数的权为所有顶点的赋值之和，罗马控制函数的最小权称为罗马控制数。该文刻画了一类正则n部竞赛图的罗马控制数。

关键词(KeyWords)： 正则n部竞赛图;罗马控制函数;罗马控制数

Abstract:

Keywords:

基金项目(Foundation): 山西省基础研究计划(20210302123202);; 山西研究生教育教学改革课题(2021YJJG254)

作者(Author): 代潇娜,张新鸿

参考文献(References)：

• [1] STEWART,IAN.Defend the Roman Empire![J].Scientific American,1999,281(6):136-138.
• [2] COCKAYNE E J,DREYER P A,HEDETNIEMI S M.Roman domination in graphs[J].Discrete Mathematics,2004,278(1-3):11-22.
• [3] HENNING M A,HEDETNIEMI S T.Defending the Roman Empire-A new strategy[J].Discrete mathematics,2003,266(1-3):239-251.
• [4] HAO GUOLIANG,CHEN XIAODAN,VOLKMANN L.Double Roman Domination in Digraphs[J].Bulletin of the Malaysian Mathematical Sciences Society,2019,42(5):1907-1920.
• [5] AHANGAR H A,LVAREZ M P,CHELLALI M,et al.Triple Roman domination in graphs[J].Applied Mathematics and Computation,2021,391:125444.
• [6] HAO GUOLIANG,ZHUANG WEI,HU KANGXIU.Total Roman domination in digraphs[J].Quaestiones Mathematicae,2019,44(3):1-18.
• [7] SHEIKHOLESLAMI S M,VOLKMANN L.Signed Roman domination in digraphs[J].Journal of Combinatorial Optimization,2013,30(3):456-467.
• [8] FU XUELIANG,YANG YUANSHENG,JIANG BOGIE.Roman domination in regular graphs[J].Discrete Mathematics,2009,309(6):1528-1537.
• [9] OULDRABAH L,BLIDIA M,BOUCHOU A.Extremal digraphs for an upper bound on the Roman domination number[J].Journal of Combinatorial Optimization,2019,38(2):667-679.
• [10] 李瑞娟，刘冬婷.正则多部竞赛图的控制图[J].应用数学学报，2016,39(4):555-561.
• [11] 张建秀，李晶，田小润.具有故障边的二维环面网络的哈密尔顿路[J].太原科技大学学报，2021,42(6):491-495.
• [12] BANG-JENSEN J,GUTIN G.Digraphs-theory,algorithms and applications[M].Springer Publishing Company,Incorporated,2010.
• [13] SHEIKHOLESLAMI S M,VOLKMANN L.The Roman domination number of a digraph[J].Kragujevac Journal of Mathematics,2011,37(2):257-268.