(k,k^,k^)-domination in graphs

MaRDI QIDQ3178815zbMATH OpenFDO

Authors B. Samadi, Hamid Reza Golmohammadi, Abdollah Khodkar

Publication date 20 December 2016

zbMATH Keywords

\((k,k',k)\)-domination number\(k\)-domination numberdomination numberrestranined domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 7059566
• Multiple domination
• Bounds on the connected \(k\)-domination number in graphs
• Bounds relating generalized domination parameters
• A generalised upper bound for the k-tuple domination number

Cited in

(8)

• New parameter of inverse domination in graphs
• \((k,r)\)-domination in graphs
• Multiple domination
• (K, j)-domination and (K, j)-reliability
• Pitchfork domination in graphs
• Linear programming formulation for some generalized domination parameters
• Captive domination in graphs
• Applying the (1,2)-pitchfork domination and it's inverse on some special graphs

This page was built for publication: \((k,k^\prime,k^{\prime\prime})\)-domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178815)