A function f:V(D)→{0,1,2}defined on the vertex set V of a digraph D is called a Roman dominating function on D if any vertex assigned 0 is adjacent to at least one in-neighbor assigned 2.The weight of a Roman dominating function is the sum of assigned values of all vertices.The Roman domination number of a digraph D is defined as the minimum weight of a Roman dominating function on D.In this paper,we characterize the Roman domination number on a kind of regular n-partite tournament.
关键词
正则n部竞赛图/罗马控制函数/罗马控制数
Key words
regular n-partite tournament/roman dominating function/roman domination number
维普
万方数据