Submitted:
27 July 2026
Posted:
28 July 2026
You are already at the latest version
Abstract
This work is related to the extension of the well-known problem of Roman domination in graph theory to fuzzy graphs. A variety of approaches have been used to explore the concept of domination in fuzzy graphs. This study uses the concept of strong domination, considering the weights of the strong edges. We introduce the strong-neighbors Roman domination number of a fuzzy graph and establish some correlations with the Roman domination in graphs. The strong-neighbors Roman domination number is determined for specific fuzzy graphs, including complete and complete bipartite fuzzy graphs. Besides, several general bounds are given. In addition, we characterize the fuzzy graphs that reach the extreme values with particular attention to fuzzy strong cycles and paths.
Keywords:
Roman domination
; fuzzy graphs
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
