scientific article; zbMATH DE number 731842

MaRDI QIDQ4325278zbMATH OpenFDO

Authors Timothy J. Bean, Michael A. Henning, H. C. Swart

Publication date 11 June 1995

zbMATH Keywords

domination numberNP-completenessindependence numberintegritydistance domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Recommendations

• A note on distance domination numbers of graphs
• scientific article; zbMATH DE number 844146
• A note on bipartite graphs whose \([1,k]\)-domination number equal to their number of vertices
• scientific article; zbMATH DE number 798658
• Bipartite graphs with close domination and \(k\)-domination numbers

Cited in

(14)

• scientific article; zbMATH DE number 238431 (Why is no real title available?)
• The 2-domination number of cylindrical graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Parameterized complexity of (d, r)-domination via modular decomposition
• Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes
• Algorithmic study on 2-transitivity of graphs
• Algorithmic aspects of the \(k\)-domination problem in graphs
• B-disjunctive total domination in graphs: algorithm and hardness results
• On bondage numbers of graphs: a survey with some comments
• A note on bipartite graphs whose \([1,k]\)-domination number equal to their number of vertices
• Equality of distance packing numbers
• Domination in commuting graph and its complement
• Multiple domination
• Domination and convexity problems in the target set selection model

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 Q4325278)