Upper bounds for \(f\)-domination number of graphs

DOI10.1016/S0012-365X(97)00204-5zbMath0955.05077OpenAlexW2286649771MaRDI QIDQ1584247

Beifang Chen, Sanming Zhou

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00204-5

zbMATH Keywords

\(f\)-domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

On the double Roman domination in graphs ⋮ Algorithmic aspects of the \(k\)-domination problem in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ A bound on the k-domination number of a graph ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Varieties of Roman Domination ⋮ Multiple Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the k-domination number of a graph
• On some extremal problems in graph theory
• An upper bound for thek-domination number of a graph
• A new domination conception
• On $f$-domination number of a graph

This page was built for publication: Upper bounds for \(f\)-domination number of graphs