Faculty Research at Morehead State University


Doug Chatham

Document Type


Publication Date



Given a (symmetrically-moving) piece from a chesslike game, such as shogi, and an n × n board, we can form a graph with a vertex for each square and an edge between two vertices if the piece can move from one vertex to the other. We consider two pieces from shogi: the dragon king, which moves like a rook and king from chess, and the dragon horse, which moves like a bishop and rook from chess. We show that the independence number for the dragon kings graph equals the independence number for the queens graph. We show that the (independent) domination number of the dragon kings graph is n − 2 for 4 6 n 6 6 and n − 3 for n > 7. For the dragon horses graph, we show that the independence number is 2n − 3 for n > 5, the domination number is at most n−1 for n > 4, and the independent domination number is at most n for n > 5.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.