Domination in generalized Petersen graphs

DOI10.1023/A:1021759001873zbMath0995.05107MaRDI QIDQ3151370

Bohdan Zelinka

Publication date: 15 October 2002

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30680

zbMATH Keywords

generalized Petersen graphtotal domatic number\(k\)-ply domatic number

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Power domination in the generalized Petersen graphs ⋮ On the 2-rainbow domination in graphs ⋮ 2-rainbow domination in generalized petersen graphs \(P(n,3)\) ⋮ On the power domination number of the generalized Petersen graphs ⋮ The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\) ⋮ NP-completeness results for partitioning a graph into total dominating sets ⋮ On the domination number of generalized petersen graphs \(P(n,2)\) ⋮ [1,2-Domination in generalized Petersen graphs] ⋮ Vertex domination of generalized Petersen graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• Total domination in graphs
• Towards a theory of domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Domination in generalized Petersen graphs