On the domination number of generalized petersen graphs \(P(n,2)\)

DOI10.1016/j.disc.2008.05.026zbMath1211.05112OpenAlexW1493972574MaRDI QIDQ1025503

Yuansheng Yang, Baoqi Jiang, Xueliang Fu

Publication date: 19 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.026

zbMATH Keywords

dominating setgeneralized Petersen graphdomination number

Mathematics Subject Classification ID

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

Related Items (8)

Hamilton cycles in double generalized Petersen graphs ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Partial domination in supercubic graphs ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ The domination complexity and related extremal values of large 3D torus ⋮ 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) ⋮ [1,2-Domination in generalized Petersen graphs] ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination number of the cross product of paths
• Dominating Cartesian products of cycles
• On the domination number of cross products of graphs
• Domination in generalized Petersen graphs
• The domination numbers of the 5 × n and 6 × n grid graphs
• The dominating number of a random cubic graph

This page was built for publication: On the domination number of generalized petersen graphs \(P(n,2)\)