Irredundance and domination in kings graphs

Discrete Mathematics

Volumn 262, Issue 1-3, 2003, Pages 131-147

  Favaron, Odile ^a   Fricke, Gerd H ^b   Pritikin, Dan ^c   Puech, Joël ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b WRIGHT STATE UNIVERSITY   (United States)

^c MIAMI UNIVERSITY   (United States)

Author keywords

Chessboard; Domination; Irredundance; King

Indexed keywords

EID: 84867934041     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00494-6     Document Type: Article

References (5)

1. E.J. Cockayne, P.J.P. Grobler, S.T. Hedetniemi, A.A. McRae, What makes an irredundant set maximal? J. Combin. Math. Combin. Comput. 25 (1997) 213-223.
2. E.J. Cockayne, S.T. Hedetniemi, D.J. Miller, Properties of hereditary hypergraphs and middle graphs, Canad. Math. Bull. 21 (1978) 461-468.
3. G.H. Fricke, S.M. Hedetniemi, S.T. Hedetniemi, A.A. McRae, C.K. Wallis, M.S. Jacobson, H.W. Martin, W.D. Weakley, Combinatorial problems on chessboards: a brief survey, in: Y. Alavi, A.J. Schwenk (Eds.), Graph Theory, Combinatorics, and Algorithms, Vol. 1, Wiley-Interscience, New York, 1995, pp. 507-528.
4. S.M. Hedetniemi, S.T. Hedetniemi, R. Reynolds, Combinatorial problems on chessboards: II, in: T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
5. A.M. Yaglom, I.M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, Vol. I: Combinatorial Analysis and Probability Theory, Holden-Day, San Francisco, 1964.