and
Download:
|
|
by W. Edwin Clark, Larry A. Dunning
http://www.emis.de/journals/EJC/Volume_4/PostScriptfiles/v4i1r26.ps
Add To MetaCart
Abstract:
Abstract. Let fl(n; ffi) denote the maximum possible domination number of a graph with n vertices and minimum degree ffi. Using known results we determine fl(n; ffi) for ffi = 0; 1; 2; 3, n ffi + 1 and for all n, ffi where ffi = n \Gamma k and n is sufficiently large relative to k. We also obtain fl(n; ffi) for all remaining values of (n; ffi) when n 14 and all but 6 values of (n; ffi) when n = 15 or 16. 1.
Citations
| 72 | Theory of graphs – Ore - 1962 |
| 69 | Combinatorics of finite sets – Anderson - 2002 |
| 12 | Domination in graphs with minimum degree two – McCuaig, Shepherd - 1989 |
| 10 | Domination-balanced graphs – Payan, Xuong - 1982 |
| 9 | On graphs having domination number half their order – Fink, Jacobson, et al. - 1985 |
| 6 | the number three – Reed, Paths - 1996 |
| 4 | Isomorph-free exhaustive generation, preprint – McKay |
| 3 | Upper bounds for the domination number of a graph, preprint – Clark, Fisher, et al. |
| 3 | Domination in graphs: a brief overview, preprint – Haynes |
