A general lower bound for the domination number of cylindrical graphs

DOI10.1007/s40840-019-00765-1zbMath1434.05080arXiv1811.01639OpenAlexW2964050653WikidataQ127959129 ScholiaQ127959129MaRDI QIDQ2305647

José Juan Carreño, José Antonio Martínez, María Luz Puertas

Publication date: 11 March 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.01639

zbMATH Keywords

cylinderCartesian productdomination numberGPU computing

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

The 2-domination number of cylindrical graphs ⋮ Total and paired domination numbers of cylinders

Uses Software

• CUDA

Cites Work

• On the efficiency index of a graph
• Computing the domination number of grid graphs
• The domination numbers of cylindrical grid graphs
• Critical cyclic patterns related to the domination number of the torus
• Bounds for the domination number of toroidal grid graphs
• Dominating Cartesian products of cycles
• Algebraic approach to fasciagraphs and rotagraphs
• The Domination Number of Grids
• 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

This page was built for publication: A general lower bound for the domination number of cylindrical graphs