Roman domination number of zero-divisor graphs over commutative rings
Combinatorics
2024-12-11 v1
Abstract
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 .
Keywords
Cite
@article{arxiv.2412.07510,
title = {Roman domination number of zero-divisor graphs over commutative rings},
author = {Ravindra Kumar and Om Prakash},
journal= {arXiv preprint arXiv:2412.07510},
year = {2024}
}
Comments
9