A Taxonomy of Perfect Domination
From MaRDI portal
Publication:5069690
Cites work
- scientific article; zbMATH DE number 4130427 (Why is no real title available?)
- scientific article; zbMATH DE number 4168533 (Why is no real title available?)
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 1202982 (Why is no real title available?)
- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- scientific article; zbMATH DE number 637310 (Why is no real title available?)
- scientific article; zbMATH DE number 637526 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 794265 (Why is no real title available?)
- scientific article; zbMATH DE number 871180 (Why is no real title available?)
- scientific article; zbMATH DE number 933213 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- scientific article; zbMATH DE number 6180527 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- scientific article; zbMATH DE number 2230323 (Why is no real title available?)
- A Best Possible Heuristic for the k-Center Problem
- A note on the existence of perfect constant weight codes
- A survey on graphs which have equal domination and closed neighbourhood packing numbers
- An almost complete description of perfect codes in direct products of cycles
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Efficient domination of the orientations of a graph
- Efficient sets in graphs
- Efficient total domination in digraphs
- Exact double domination in graphs
- Generalized domination and efficient domination in graphs
- Independent domination in graphs: A survey and recent results
- Independent sets with domination constraints
- Nearly perfect sets in graphs
- On perfect codes and related concepts
- On perfect double dominating sets in grids, cylinders and tori
- On the Diagonal Hypergraph of a Matrix
- On weighted efficient total domination
- Open packing, total domination, and the P₃-Radon number
- Perfect Codes in Antipodal Distance-Transitive Graphs.
- Perfect codes and independent dominating sets
- Perfect codes in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Regular codes in regular graphs are difficult
- The weighted perfect domination problem
- Topics on perfect graphs
- Total Domination in Categorical Products of Graphs
- Total perfect codes in grid graphs
- Total perfect codes in tensor products of graphs.
- Weighted efficient domination problem on some perfect graphs
- Weighted independent perfect domination on cocomparability graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
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
- Perfect domination ratios of Archimedean lattices
- On the perfect differential of a graph
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)
