Domination parameters for the bishops graph (Q1081616)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Domination parameters for the bishops graph |
scientific article; zbMATH DE number 3970789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domination parameters for the bishops graph |
scientific article; zbMATH DE number 3970789 |
Statements
Domination parameters for the bishops graph (English)
0 references
1986
0 references
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.
0 references
independent domination number
0 references
total domination number
0 references
bishops graph
0 references
0 references
0.89242655
0 references
0.88410527
0 references
0 references
0.87691873
0 references
0 references
