Critical cyclic patterns related to the domination number of the torus

DOI10.1016/j.disc.2005.09.047zbMath1119.05084OpenAlexW2052376535MaRDI QIDQ864152

Douglas M. Van Wieren

Publication date: 13 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.047

zbMATH Keywords

torusVizing's conjecturedominating setmeshdomination numbergrid graphCartesian product of graphscardinal product of graphscross product of cycles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ A note on the weakly convex and convex domination numbers of a torus ⋮ Generic algorithms for some decision problems on fasciagraphs and rotagraphs ⋮ A general lower bound for the domination number of cylindrical graphs

Cites Work

• Domination number of the cross product of paths
• On domination numbers of Cartesian products of paths
• Total domination number of grid graphs
• The domination number of \(C_8 \times C_n\) and \(C_9 \times C_n\)
• Dominating Cartesian products of cycles
• Algebraic approach to fasciagraphs and rotagraphs
• On some algebras of analytic functions on finite open Riemann surfaces
• The domination numbers of the 5 × n and 6 × n grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Critical cyclic patterns related to the domination number of the torus