Document Type
Article
Publication Date
2018
Abstract
For a chessboard graph and a given graph parameter π, a π separation number is the minimum number of pawns for which some arrangement of those pawns on the board will produce a board where π has some desired value. We extend previous results on independence and domination separation. We also consider separation of other domination-related parameters.
Recommended Citation
International Journal of Graphs and Combinatorics, 15(3), 251-260.
Included in
Educational Assessment, Evaluation, and Research Commons, Higher Education Commons, Higher Education and Teaching Commons