On Domination in Path, Cycle, Star, Wheel and Grid Graphs

Abstract

Domination is one of the important concepts in graph theory with applications
in communication networks, facility location problems and social network analysis.
In this paper we study domination numbers for several basic graphs including path
graphs, cycle graphs, star graphs, wheel graphs and grid graphs. Exact formulas for
domination numbers are obtained and relationships between different classes of graphs
are discussed. Illustrative examples, tables and diagrams are provided.