1 |
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998
|
2 |
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in Graphs, Marcel Dekker, Inc., New York, 1998
|
3 |
W. McCuaig and B. Shepherd, Domination in graphs with minimum degree two, J. Graph Theory 13 (1989), no. 6, 749–762
DOI
|
4 |
O. Ore, Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, R.I. 1962
|
5 |
B. A. Reed, Paths, stars and the number three, Combin. Probab. Comput. 5 (1996), no. 3, 277–295
DOI
|
6 |
B. A. Reed, Paths, stars and the number three: the grunge, University of Waterloo, Technical Report, 1993
|
7 |
N. Alon and J. H. Spencer, The Probabilistic Method, Wiley-Interscience, New York, 1992
|
8 |
M. R. Garey and D. S. Johnson, Computers and intractability, A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman and Co., San Francisco, Calif., 1979
|
9 |
C. Payan and N. H. Xuong, Domination-balanced graphs, J. Graph Theory 6 (1982), no. 1, 23–32
DOI
|
10 |
L. A. Sanchis, Bounds related to domination in graphs with minimum degree two, J. Graph Theory 25 (1997), no. 2, 139–152
DOI
ScienceOn
|
11 |
Y. Caro and Y. Roditty, On the vertex-independence number and star decomposition of graphs, Ars Combin. 20 (1985), 167–180
|
12 |
Y. Caro and Y. Roditty, A note on the k-domination number of a graph, Internat. J. Math. Math. Sci. 13 (1990), no. 1, 205–206
DOI
|
13 |
G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd Edition, Chapman and Hall, London, 1996
|