scientific article; zbMATH DE number 861309

MaRDI QIDQ4871033zbMATH OpenFDO

Authors Sandra M. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Aniket Majumdar, Renu C. Laskar

Publication date 21 May 1996

zbMATH Keywords

dominationindependenceirredundanceline graphNP-completenesssurveytotal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A survey of selected recent results on total domination in graphs
• scientific article; zbMATH DE number 13196
• scientific article; zbMATH DE number 1109413
• On the total \(k\)-domination in graphs

Cited in

(14)

• On the sum of two parameters concerning independence and irredundance in a graph
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• Using maximality and minimality conditions to construct inequality chains
• The rati of the irredundance and domination number of a graph
• Improved parameterized algorithms and kernels for mixed domination
• Cycle domination, independence, and irredundance in graphs
• Split Domination, Independence, and Irredundance in Graphs
• Edge Cut Domination, Irredundance, and Independence in Graphs
• scientific article; zbMATH DE number 13196 (Why is no real title available?)
• scientific article; zbMATH DE number 6848616 (Why is no real title available?)
• On the decomposition of total graphs
• The algorithmic complexity of mixed domination in graphs
• Explicit construction of mixed dominating sets in generalized Petersen graphs
• A survey of selected recent results on total domination in graphs

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