Explicit construction of mixed dominating sets in generalized Petersen graphs

DOI10.1007/s10878-024-01222-xMaRDI QIDQ6646750

Mohammadreza Hooshmandasl, A. Shakiba, Mohsen Alambardar Meybodi, Meysam Rajaati Bavil Olyaei

Publication date: 3 December 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

dominating setgeneralized Petersen graphPetersen graphmixed dominating set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The algorithmic complexity of mixed 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
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• On the mixed domination problem in graphs
• On the domination number of the generalized Petersen graphs
• Total matchings and total coverings of graphs
• I-graphs and the corresponding configurations

This page was built for publication: Explicit construction of mixed dominating sets in generalized Petersen graphs