Basic Minimal Dominating Functions of Quadratic Residue Cayley Graphs

Domination arises in the study of numerous facility location problems where the number of facilities is fixed and one attempt to minimize the number of facilities necessary so that everyone is serviced. This problem reduces to finding a minimum dominating set in the graph corresponding to this network. In this paper we study the minimal dominating functions and basic minimal dominating functions of quadratic residue Cayley graphs and results on these functions have been obtained.