The domination number of C_n P_m for n 25

DOI10.61091/jcmcc120-040MaRDI QIDQ6586572zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/jcmcc120-040

zbMATH Keywords

domination numberdynamic programming algorithmgrid graph

Mathematics Subject Classification ID

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

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

Cites work

• A general lower bound for the domination number of cylindrical graphs
• A note on the domination number of the Cartesian products of paths and cycles
• Domination of cylinder graphs
• scientific article; zbMATH DE number 842019 (Why is no real title available?)

Cited in

(2)

• A new lower bound for the domination number of complete cylindrical grid graphs
• The 2-rainbow domination number of Cartesian bundles over cycles

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)