A Taxonomy of Perfect Domination
From MaRDI portal
Publication:5069690
DOI10.1080/09720529.2014.914288zbMATH Open1495.05229OpenAlexW2074243375MaRDI QIDQ5069690FDOQ5069690
Authors: 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
Cites Work
- Title not available (Why is that?)
- Generalized domination and efficient domination in graphs
- Perfect codes in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Total perfect codes in tensor products of graphs.
- A Best Possible Heuristic for the k-Center Problem
- Title not available (Why is that?)
- Independent domination in graphs: A survey and recent results
- Open packing, total domination, and the \(P_3\)-Radon number
- Independent sets with domination constraints
- Nearly perfect sets in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On perfect codes and related concepts
- A note on the existence of perfect constant weight codes
- The weighted perfect domination problem
- Title not available (Why is that?)
- Weighted efficient domination problem on some perfect graphs
- Weighted independent perfect domination on cocomparability graphs
- Title not available (Why is that?)
- Efficient total domination in digraphs
- Perfect Codes in Antipodal Distance-Transitive Graphs.
- Total perfect codes in grid graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics on perfect graphs
- Regular codes in regular graphs are difficult
- On weighted efficient total domination
- Efficient domination of the orientations of a graph
- An almost complete description of perfect codes in direct products of cycles
- Title not available (Why is that?)
- Efficient sets in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Perfect codes and independent dominating sets
- On perfect double dominating sets in grids, cylinders and tori
- Exact double domination in graphs
- Total Domination in Categorical Products of Graphs
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Diagonal Hypergraph of a Matrix
- Title not available (Why is that?)
- A survey on graphs which have equal domination and closed neighbourhood packing numbers
- Title not available (Why is that?)
Cited In (14)
- On perfect Roman domination number in trees: complexity and bounds
- Packing in regular graphs
- Perfect double Italian domination of a graph
- Zero forcing versus domination in cubic graphs
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
- Rainbow perfect domination in lattice graphs
- Characterization of perfect Roman domination edge critical trees
- Perfect double Roman domination of trees
- Varieties of Roman Domination
- Perfect Roman domination in regular graphs
- Perfect Roman domination in trees
- Perfect Italian domination in trees
- On the perfect differential of a graph
- Perfect domination ratios of Archimedean lattices
This page was built for publication: A Taxonomy of Perfect Domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069690)
