Theoretical study determines domination numbers across new graph families, highlighting practical applications in network design and security analysis.
Key Points
Domination numbers are established for antiprism graphs, alternate pentagonal snakes, and cycles with one chord to optimize discrete networks.
Theoretical graph analysis evaluates vertex subsets ensuring every remaining node connects directly to at least one element within set D.