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.
Recommendations
- scientific article; zbMATH DE number 1124603
- Domination in bipartite graphs
- Domination parameters of a graph and its complement
- Domination parameters in Mycielski graphs
- scientific article; zbMATH DE number 5123583
- Bipartite Domination in Graphs
- scientific article; zbMATH DE number 6712580
- Domination in bipartite graphs and in their complements
- scientific article; zbMATH DE number 617552
- Domination in some subclasses of bipartite graphs
Cites work
Cited in
(9)- On bounds for a board covering problem
- Chessboard domination problems
- scientific article; zbMATH DE number 6712580 (Why is no real title available?)
- An introduction to influence parameters for chessboard graphs
- Domination in chessboards
- scientific article; zbMATH DE number 2077666 (Why is no real title available?)
- Improved lower bounds for Queen's Domination via an exactly-solvable relaxation
- Chessboard domination: introduction of some new problems
- Bibliography on domination in graphs and some basic definitions of domination parameters
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)