Domination parameters for the bishops graph
The vertices of a ''bishops'' graph are the squares of the \(n\times n\) chessboard and two vertices are adjacent if their squares lie on a common diagonal. For this type of graphs, there are calculated three domination parameters: the smallest cardinality of a dominating set, of an independent dominating set and of a total dominating set of a bishops graph.
scientific article; zbMATH DE number 3970789