|
|||||
|
|
On Domination Number of 4-Regular Graphs |
|
| Authors: | Hailong?Liu mailto:iu_hailong@.com" title=" iu_hailong@.com" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,Liang?Sun mailto:sun@yahoo.com" title=" sun@yahoo.com" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author |
| Affiliation: | (1) Department of Applied Mathematics, Beijing Institute of Technology, Beijing, 100081, P. R. China;(2) Department of Applied Mathematics, Beijing Institute of Technology, Beijing, 100081, P.R. China |
| Abstract: | Let G be a simple graph. A subset S  V is a dominating set of G, if for any vertex v  V – S there exists a vertex u S such that uv E(G). The domination number, denoted by  (G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then (G)  4/11 n |
| Keywords: | regular graph dominating set domination number |
| 本文献已被 SpringerLink 等数据库收录！ | |