Explicit construction of mixed dominating sets in generalized Petersen graphs

DOI10.1007/S10878-024-01222-XMaRDI QIDQ6646750zbMATH OpenFDO

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

Publication date 3 December 2024

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

Full work available at URL https://doi.org/10.1007/S10878-024-01222-X

zbMATH Keywords

dominating setgeneralized Petersen graphmixed dominating setPetersen graph

Mathematics Subject Classification ID

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

Recommendations

• Mixed tree domination number
• The exact domination number of generalized Petersen graphs P(n,k) with n=3k
• On the mixed domination problem in graphs
• Mixed domination in undirected path graphs and block graphs
• On the domination number of generalized Petersen graphs P(n,3).

Cites work

• scientific article; zbMATH DE number 861309 (Why is no real title available?)
• I-graphs and the corresponding configurations
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• On the domination number of generalized petersen graphs \(P(n,2)\)
• On the domination number of the generalized Petersen graphs
• On the mixed domination problem in graphs
• The algorithmic complexity of mixed domination in graphs
• The exact domination number of the generalized Petersen graphs
• Total matchings and total coverings of graphs
• Vertex domination of generalized Petersen graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646750)