Corpus ID: 4184832

Independence and Domination Separation on Chessboard Graphs

  title={Independence and Domination Separation on Chessboard Graphs},
  author={R. D. Chatham and M. Doyle and G. Fricke and J. Reitmann and R. Skaggs and M. Wolff},
  • R. D. Chatham, M. Doyle, +3 authors M. Wolff
  • Published 2006
  • A legal placement of Queens is any placement of Queens on an order N chessboard in which any two attacking Queens can be separated by a Pawn. The Queens independence separation number is the minimum number of Pawns which can be placed on an N ×N board to result in a separated board on which a maximum of m independent Queens can be placed. We prove that N + k Queens can be separated by k Pawns for large enough N and provide some results on the number of fundamental solutions to this problem. We… CONTINUE READING
    7 Citations

    Figures and Tables from this paper

    Perfect domination separation on square chessboard
    • PDF
    The Maximum Queens Problem with Pawns
    • 2
    • PDF
    Reflections on the N + k Queens Problem
    • 9
    Centrosymmetric Solutions to Chessboard Separation Problems
    • 1
    • PDF
    Identifying vertices in graphs and digraphs
    • 11
    • PDF


    An improved upper bound for queens domination numbers
    • 15
    • PDF
    The combinatorics of chessboards
    • 7
    Different perspectives of the N-Queens problem
    • 48
    Chessboard domination problems
    • E. Cockayne
    • Computer Science, Mathematics
    • Discret. Math.
    • 1990
    • 59
    • PDF
    Domination parameters for the bishops graph
    • 9
    Fundamentals of domination in graphs
    • 3,130
    • PDF
    Linear Congruence Equations for the Solutions of the N-Queens Problem
    • 17
    Across the board: The mathematics of chessboard problems
    • 73
    Changing and unchanging of the domination number of a graph
    • 26
    • PDF
    A circulant matrix based approach to storage schemes for parallel memory systems
    • C. Erbas, M. Tanik, S. Nair
    • Computer Science
    • Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing
    • 1993
    • 10