Bounds for the 2-domination number of toroidal grid graphs

DOI10.1080/00207160701690284zbMath1162.05036OpenAlexW2148698680MaRDI QIDQ3630030

Ramy S. Shaheen

Publication date: 2 June 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a794799755

zbMATH Keywords

cyclesgraph productsgrid graphtoroidal\(k\)-domination\(k\)-dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (12)

On trees with equal 2-domination and 2-outer-independent domination numbers ⋮ Pure Nash equilibria of competitive diffusion process on toroidal grid graphs ⋮ On the complexity of reinforcement in graphs ⋮ On the 2-domination Number of Cylinders with Small Cycles ⋮ The p-domination number of complete multipartite graphs ⋮ On the ratio between 2-domination and total outer-independent domination numbers of trees ⋮ An upper bound on the 2-outer-independent domination number of a tree ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ NP-hardness of multiple bondage in graphs ⋮ Multiple Domination ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ On the complexity of multiple bondage in graphs

Cites Work

• An upper bound for thek-domination number of a graph

This page was built for publication: Bounds for the 2-domination number of toroidal grid graphs