加载中…
For a graph , a Roman dominating function is a map satisfies the property that if , then must have adjacent to at least one vertex such that . The weight of a Roman dominating function is the value , and the minimum weight of a Roman dominating function on is called the Roman domination number of , denoted by . The main focus of this paper is to study the Roman domination number of zero-divisor graph and find the bounds of the Roman domination number of .

生成讲解博客的中文版本

生成AI智能校验的中文版本