Domination parameters for the bishops graph

From MaRDI portal





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.











This page was built for publication: Domination parameters for the bishops graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081616)