The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)

DOI10.1007/s40314-013-0077-8zbMath1306.05183OpenAlexW2465902253MaRDI QIDQ2514066

Juan Liu, Xindong Zhang

Publication date: 30 January 2015

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-013-0077-8

zbMATH Keywords

combinatorial problemsgeneralized Petersen graphdomination numberefficient dominating set

Mathematics Subject Classification ID

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

Related Items (5)

Strong edge chromatic index of the generalized Petersen graphs ⋮ Unnamed Item ⋮ Domination in rose window graphs ⋮ The domination complexity and related extremal values of large 3D torus ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• The exact domination number of the generalized Petersen graphs
• Vertex domination of generalized Petersen graphs
• On the domination number of the generalized Petersen graphs
• Domination in generalized Petersen graphs
• Unnamed Item

This page was built for publication: The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)