On F-domination in graphs
From MaRDI portal
Publication:5154559
Recommendations
- On f-domination number of a graph
- Algorithmic aspects of \(\mathcal{F}\)-domination in graphs
- Inequalities involving independence domination, f-domination, connected and total f-domination numbers
- Invariants concerning \(f\)-domination in graphs
- A contribution to upper domination, irredundance and distance-2 domination in graphs
Cites work
Cited in
(7)- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- \(F_3\)-domination problem of graphs
- scientific article; zbMATH DE number 5717271 (Why is no real title available?)
- On f-domination number of a graph
- Invariants concerning \(f\)-domination in graphs
- scientific article; zbMATH DE number 1390094 (Why is no real title available?)
- Algorithmic aspects of \(\mathcal{F}\)-domination in graphs
This page was built for publication: On \(\mathcal{F}\)-domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154559)