Inequalities involving independence domination, f-domination, connected and total f-domination numbers
From MaRDI portal
(Redirected from Publication:4814435)
Recommendations
Cites work
- scientific article; zbMATH DE number 3918387 (Why is no real title available?)
- scientific article; zbMATH DE number 3572162 (Why is no real title available?)
- A new domination conception
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On f-domination number of a graph
- On domination and independent domination numbers of a graph
- On the Number of Disjoint Edges in a Graph
- Total domination in graphs
Cited in
(9)- On \(\mathcal{F}\)-domination in graphs
- A bound on the k-domination number of a graph.
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- A structure preserving generalization of independence, domination and irredundance
- Invariants concerning \(f\)-domination in graphs
- On f-domination number of a graph
- A continuous generalization of domination-like invariants
- Upper bounds for \(f\)-domination number of graphs
This page was built for publication: Inequalities involving independence domination, f-domination, connected and total f-domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4814435)