Event Dime
Equitable Domination in Turiyam Graphs with Network Applications [version 1; peer review: awaiting peer review]
Festivals & Fairs
- When:
- June 1, 2026 ยท 5:23 AM
- Source:
- F1000Research
Background Turiyam graphs provide a mathematical framework for representing systems with uncertainty, inconsistency, incomplete information, and refusal conditions. This study introduces the concept of equitable domination in Turiyam graphs to achieve balanced dominance among neighboring vertices and reduce excessive dependence on individual nodes in uncertain network structures. Methods The study defines equitable dominating sets in Turiyam graphs and investigates their theoretical properties.