A Taxonomy of Perfect Domination

DOI10.1080/09720529.2014.914288zbMath1495.05229OpenAlexW2074243375MaRDI QIDQ5069690

William F. Klostermeyer

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2014.914288

zbMATH Keywords

dominating setperfect domination

Mathematics Subject Classification ID

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

Related Items (14)

Unnamed Item ⋮ On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Perfect Roman domination in trees ⋮ Perfect double Italian domination of a graph ⋮ Packing in regular graphs ⋮ Perfect Italian domination in trees ⋮ Perfect roman domination in regular graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ Varieties of Roman Domination ⋮ Perfect double Roman domination of trees ⋮ On perfect Roman domination number in trees: complexity and bounds ⋮ Perfect domination ratios of Archimedean lattices ⋮ Rainbow perfect domination in lattice graphs

Cites Work

• On weighted efficient total domination
• Efficient total domination in digraphs
• A note on the existence of perfect constant weight codes
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Efficient sets in graphs
• Topics on perfect graphs
• An almost complete description of perfect codes in direct products of cycles
• The weighted perfect domination problem
• Characterizing \(r\)-perfect codes in direct products of two and three cycles
• Generalized domination and efficient domination in graphs
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
• Regular codes in regular graphs are difficult
• Weighted efficient domination problem on some perfect graphs
• Efficient domination of the orientations of a graph
• Nearly perfect sets in graphs
• Weighted independent perfect domination on cocomparability graphs
• Independent domination in graphs: A survey and recent results
• Open packing, total domination, and the \(P_3\)-Radon number
• Independent sets with domination constraints
• A survey on graphs which have equal domination and closed neighbourhood packing numbers
• Perfect codes in graphs
• A Best Possible Heuristic for the k-Center Problem
• On the Diagonal Hypergraph of a Matrix
• Perfect Codes in Antipodal Distance-Transitive Graphs.
• Total Domination in Categorical Products of Graphs
• Exact double domination in graphs
• On perfect codes and related concepts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Taxonomy of Perfect Domination