Locating fair domination in graphs
From MaRDI portal
Cites work
- Complementary equitably totally disconnected equitable domination in graphs
- Dominating sets in n‐cubes
- Domination and location in acyclic graphs
- Equitable fair domination in graphs
- Fair domination in graphs
- Fair domination number in cactus graphs
- scientific article; zbMATH DE number 5942290 (Why is no real title available?)
- scientific article; zbMATH DE number 5553874 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- scientific article; zbMATH DE number 5492426 (Why is no real title available?)
- Locating-domination and identifying codes in trees
- Nearly perfect sets in graphs
- On locating-domination in graphs
- Outer complete fair domination in graphs
- Perfect \(k\)-domination in graphs
- The weighted perfect domination problem
- Trees and unicyclic graphs with large fair domination number
Cited in
(1)
This page was built for publication: Locating fair domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983434)