Reliability-Aware Input–Output Domination in Complex and Neutrosophic Networks

The present work discusses a reliability-aware variant of the prominent IO-dominating set problem through the formulation of a novel aspect termed the Reliable IO Dominating Set (RIO-dominating set) Problem. Theoretical analysis verifies the NP-completeness of the RIO-dominating set Problem, confirming its position as a tight extension of the IO-dominating set Problem. A greedy approach is drafted to advance a solution construct through the Reliability-Based IO-Dominating Set Problem and its evaluations on synthetic networks exemplifying the impact of vertex reliability on domination structures.