Theoretical analysis establishes efficient domination theorems across graph operations in single valued neutrosophic graphs, indicating new mathematical frameworks for uncertain networks.
In this paper, we introduce the concept of efficient domination under various graph operations such as union, composition, direct product, strong product of single valued neutrosophic graphs. We try to prove several theorems under these operations.
No takes yet. Share an insight, caveat, or question.
Fathima et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: