[1,2]-Domination in generalized Petersen graphs

DOI10.1142/S1793830919500587zbMath1426.05160arXiv1906.11966MaRDI QIDQ5242832

Volker Turau, Fairouz Beggas, Hamamache Kheddouci, Mohammed Haddad

Publication date: 7 November 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.11966

zbMATH Keywords

\([1,2\)-total domination]

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On \([j, k\)-sets in graphs]

Cites Work

• Unnamed Item
• \([1,2\)-domination in graphs]
• On the domination number of generalized petersen graphs \(P(n,2)\)
• The exact domination number of the generalized Petersen graphs
• Vertex domination of generalized Petersen graphs
• \([1,2\)-sets in graphs]
• On the domination number of the generalized Petersen graphs
• ON THE SIGNED TOTAL DOMINATION NUMBER OF GENERALIZED PETERSEN GRAPHS P(n, 2)
• Domination in generalized Petersen graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs

This page was built for publication: [1,2]-Domination in generalized Petersen graphs