The domination number of C_n P_m for n 25

DOI10.61091/jcmcc120-040zbMATH Open1545.05165MaRDI QIDQ6586572FDOQ6586572

Authors: David R. Guichard 

Publication date: 13 August 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• A new lower bound for the domination number of complete cylindrical grid graphs
• The domination numbers of cylindrical grid graphs
• scientific article; zbMATH DE number 2114690
• A general lower bound for the domination number of cylindrical graphs
• Domination of cylinder graphs

zbMATH Keywords

domination numberdynamic programming algorithmgrid graph

Mathematics Subject Classification ID

Dynamic programming (90C39) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• A note on the domination number of the Cartesian products of paths and cycles
• A general lower bound for the domination number of cylindrical graphs
• Domination of cylinder graphs

Cited In (1)

• A new lower bound for the domination number of complete cylindrical grid graphs

This page was built for publication: The domination number of \(C_n\square P_m\) for \(n\equiv 2\pmod{5} \)

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