scientific article; zbMATH DE number 6813629

MaRDI QIDQ4595227zbMATH OpenFDO

Authors Nader Jafari Rad, Hailiza Kamarulhaili

Publication date 29 November 2017

Full work available at URL http://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p265.pdf

zbMATH Keywords

\(k\)-rainbow domination numberdomination number

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of multiple bondage in graphs
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• Some progress on total bondage in graphs
• NP-hardness of multiple bondage in graphs
• Bounds on the bondage number of a graph
• On the bondage number of a graph
• On the Grundy bondage numbers of graphs
• The bondage number of some graphs
• On bondage numbers of graphs: a survey with some comments
• On the bondage number of planar and directed graphs

Cited in

(12)

• On the complexity of multiple bondage in graphs
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• Complexity and bounds for disjunctive total bondage
• Rainbow domination in graphs
• On the complexity of the bondage and reinforcement problems
• NP-hardness of multiple bondage in graphs
• Semitotal bondage numbers of graphs
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
• Independent k -rainbow bondage number of graphs
• Non-isolating bondage in graphs
• Complexity results on paired domination in cubic graphs
• A survey of bond graphs: Theory, applications and programs

This page was built for publication:

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