On domination numbers of Cartesian products of paths

DOI10.1016/S0166-218X(97)00091-7zbMath0898.05040OpenAlexW2075458544MaRDI QIDQ1382283

Sylvain Gravier, Michel Mollard

Publication date: 27 October 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

pathsCartesian product\(r\)-domination number\(r\)-dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (13)

Outer-2-independent domination in graphs ⋮ Total domination number of grid graphs ⋮ Total edge irregularity strength of generalized prism ⋮ Total vertex irregularity strength of generalized prism graphs ⋮ Critical cyclic patterns related to the domination number of the torus ⋮ Some algebraic polynomials and topological indices of generalized prism and toroidal polyhex networks ⋮ On domination number of Cartesian product of directed paths ⋮ Domination number of Cartesian products of directed cycles ⋮ The domination number of Cartesian product of two directed paths ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ On domination number of Cartesian product of directed cycles ⋮ Some classifications of graphs with respect to a set adjacency relation

Cites Work

• Unnamed Item
• Unnamed Item
• Dominating Cartesian products of cycles
• The domination numbers of the 5 × n and 6 × n grid graphs
• Perfect Codes in the Lee Metric and the Packing of Polyominoes

This page was built for publication: On domination numbers of Cartesian products of paths