Domination and irredundance in the queens' graph (Q1356524): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Alewyn P. Burger / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Christina M. Mynhardt / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination and irredundance in the queens' graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4309111 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552199 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139865 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871169 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bibliography on domination in graphs and some basic definitions of domination parameters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871084 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00327-s / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071807082 / rank | |||
Normal rank |
Latest revision as of 11:28, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Domination and irredundance in the queens' graph |
scientific article |
Statements
Domination and irredundance in the queens' graph (English)
0 references
26 October 1997
0 references
The vertices of the queens' graph \(Q_n\) are the squares of an \(n\times n\) chessboard and two squares are adjacent if a queen placed on one covers the other. This paper shows that the domination number of \(Q_n\) is at most \(31n/54+ O(1)\), that \(Q_n\) possesses minimal dominating sets of cardinality \(5n/2- O(1)\) and that the cardinality of any irredundant set of vertices of \(Q_n\) \((n\geq q)\) is at most \(\lfloor 6n+6-8\sqrt{n+\sqrt n+1}\rfloor\).
0 references
queens' graph
0 references
chessboard
0 references
domination number
0 references
dominating sets
0 references
irredundant set
0 references
0 references