Domination of graphs in Z^n_p and in Z^n₃ Z^m₂

zbMATH Open1212.05198MaRDI QIDQ3570232FDOQ3570232

Eduardo Piza Volio

Publication date: 25 June 2010

zbMATH Keywords

combinatoricsgraph dominationsimulating annealingfootball pool problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

   Recommendations

• On Domination in Graphs 👍 👎
• The domination numbers of cylindrical grid graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Computing the domination number of grid graphs 👍 👎

This page was built for publication: Domination of graphs in \(\mathbf{Z}^{n}_{p}\) and in \(\mathbf{Z}^{n}_{3} \times \mathbf{Z}^{m}_{2}\)

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