Domination parameters for the bishops graph
type: Item
instance of: scholarly article
title: Domination parameters for the bishops graph
zbMATH Open document ID: 0602.05040
DOI: 10.1016/0012-365X(86)90139-1
author: B. George
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3970789
zbMATH Keywords: independent domination number
zbMATH Keywords: total domination number
zbMATH Keywords: bishops graph
MaRDI profile type: Publication
cites work: Q3277097
cites work: On the diagonal queens domination problem
cites work: Q3708029
cites work: Unsolved problems in number theory
Recommended article: Q4378632
Recommended article: Domination in bipartite graphs
Recommended article: Domination parameters of a graph and its complement
Recommended article: DOMINATION PARAMETERS IN MYCIELSKI GRAPHS
Recommended article: Q3421955
Recommended article: Bipartite Domination in Graphs
Recommended article: Q2981134
Recommended article: Domination in Bipartite Graphs and in Their Complements
Recommended article: Q4301873
Recommended article: Domination in Some Subclasses of Bipartite Graphs
description: scientific article; zbMATH DE number 3970789