Perfect domination in knights graphs

MaRDI QIDQ5224848zbMATH OpenFDO

Authors Todd Fenstermacher, Soumendra Ganguly, Renu C. Laskar

Publication date 24 July 2019

Full work available at URL https://arxiv.org/abs/1805.03335

zbMATH Keywords

perfect dominating setperfect domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: For a graph $G=(V,E),$ a subset $S$ of $V$ is a perfect dominating set of $G$ if every vertex not in $S$ is adjacent to exactly one vertex in $S.$ The perfect domination number, $gamm{a}_p(G),$ is the minimum cardinality of a perfect dominating set of $G.$ The perfect domination number is found for knights graphs on square, rectangular, and infinite chessboards. Indeed, exact values or bounds are given for all chessboards except those with 3 rows and number of columns congruent to 1, 2, or 3 modulo 8.

Recommendations

• Perfect \(k\)-domination in graphs
• Efficient domination in knights graphs
• scientific article; zbMATH DE number 5553874
• Generalized perfect domination in graphs
• scientific article; zbMATH DE number 653239

Cited in

(2)

• Efficient domination in knights graphs
• scientific article; zbMATH DE number 844149 (Why is no real title available?)

This page was built for publication: Perfect domination in knights graphs

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