scientific article; zbMATH DE number 844146

MaRDI QIDQ4865131zbMATH OpenFDO

Authors Stephen T. Hedetniemi, Michael A. Henning, Gerd H. Fricke

Publication date 22 August 1996

zbMATH Keywords

distanceboundNP-completeindependent domination number\(n\)-independent setdistance independent domination\(n\)-independent domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• scientific article; zbMATH DE number 749270
• The ratio of the distance irredundance and domination numbers of a graph
• scientific article; zbMATH DE number 140152
• scientific article; zbMATH DE number 861435
• scientific article; zbMATH DE number 798658

Cited in

(11)

• scientific article; zbMATH DE number 238431 (Why is no real title available?)
• Distance independence in graphs
• Distance domination versus iterated domination
• Graph Domination in Distance Two
• scientific article; zbMATH DE number 140152 (Why is no real title available?)
• An algorithm to find two distance domination parameters in a graph
• The d-distance p-packing domination number: complexity, cycles, and trees
• On the existence and on the number of (k,l)-kernels in the lexicographic product of graphs
• Distance domination in graphs
• scientific article; zbMATH DE number 731842 (Why is no real title available?)
• scientific article; zbMATH DE number 638684 (Why is no real title available?)

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