On domination number of 4-regular graphs
Hailong Liu, Liang Sun (2004)
Czechoslovak Mathematical Journal
Similarity:
Let be a simple graph. A subset is a dominating set of , if for any vertex there exists a vertex such that . The domination number, denoted by , is the minimum cardinality of a dominating set. In this paper we prove that if is a 4-regular graph with order , then .