Distance independent domination in iterated line graphs

MaRDI QIDQ3428642zbMATH OpenFDO

Authors Martin Knor, Ludovit Niepel

Publication date 29 March 2007

zbMATH Keywords

domination numberpacking number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1506508
• On the k-independence number in graphs
• scientific article; zbMATH DE number 1124605
• scientific article; zbMATH DE number 2544
• Distance domination in graphs

Cited in

(4)

• Index of parameters of iterated line graphs
• Distance domination versus iterated domination
• On the (h,k)-domination numbers of iterated line digraphs
• scientific article; zbMATH DE number 1506508 (Why is no real title available?)

This page was built for publication: Distance independent domination in iterated line graphs

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