Strong Edge-Based Roman Domination in Fuzzy Graphs
J. C. Valenzuela-Tripodoro, P. García-Vázquez, M. Cera López
Source record
Source: Crossref
Published: Jul 28, 2026
DOI: 10.20944/preprints202607.2040.v1
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.