On the domination number of the Cartesian product of the cycle of length \(n\) and any graph

DOI10.1016/j.dam.2006.07.003zbMath1112.05074OpenAlexW1992801013MaRDI QIDQ869572

Mohamed H. El-Zahar, Soheir Mohamed Khamis, Khalida Nazzal

Publication date: 8 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.003

zbMATH Keywords

Vizing's conjecture

Mathematics Subject Classification ID

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

Related Items (7)

\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ The domination numbers of cylindrical grid graphs ⋮ Domination number of Cartesian products of directed cycles ⋮ The domination number of Cartesian product of two directed paths ⋮ Bounds on the size of the minimum dominating sets of some cylindrical grid graphs ⋮ On domination number of Cartesian product of directed cycles

Cites Work

• On graphs having domination number half their order
• A result on Vizing's conjecture
• An inequality related to Vizing's conjecture
• Domination-balanced graphs
• On dominating the Cartesian product of a graph and K₂
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the domination number of the Cartesian product of the cycle of length \(n\) and any graph