Abstract
Suppose = , is a graph. A Roman dominating function (RDF) of is a function: → {0,1,2} such that every vertex for which = 0 has a neighbor with = 2. The weight of an RDF is = Σ ∈ . The Roman domination number (RDN) of a graph , denoted by ℘, is the minimum weight of all possible RDFs. In this study, we define RDF on fuzzy graph (FG). Our purpose is to develop a notion of the RDF and also to present some basic definitions, notations, remarks, and proofs related to RDF on FGs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
