Domination number of the cross product of paths

DOI10.1016/S0166-218X(99)00016-5zbMath0923.05031OpenAlexW1989508789MaRDI QIDQ1293195

Sylvain Gravier, Ismail Zighem, Rachid Chérifi, Xavier Lagraula, Charles Payan

Publication date: 25 October 1999

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00016-5

zbMATH Keywords

pathdomination numbercross productsquare productcomplete grid

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Critical cyclic patterns related to the domination number of the torus ⋮ Dominating direct products of graphs ⋮ On the total domination number of cross products of graphs ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice ⋮ On the domination number of generalized petersen graphs \(P(n,2)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unit disk graphs
• Dominating Cartesian products of cycles
• On the domination number of cross products of graphs
• Algebraic approach to fasciagraphs and rotagraphs
• On a Vizing-like conjecture for direct product graphs
• The NP-completeness column: an ongoing guide
• The domination numbers of the 5 × n and 6 × n grid graphs

This page was built for publication: Domination number of the cross product of paths