Small edge dominating sets of regular graphs

MaRDI QIDQ2845517zbMATH OpenFDO

Authors W. Duckworth

Publication date 30 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066103000124

zbMATH Keywords

edge domination numberlower boundsrandom regular graphsmallest edge dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the Independent Domination Number of Random Regular Graphs
• scientific article; zbMATH DE number 2019630
• Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
• scientific article; zbMATH DE number 2230938
• Connected domination of regular graphs

Cited in

(4)

• Bounding and approximating minimum maximal matchings in regular graphs
• scientific article; zbMATH DE number 4081595 (Why is no real title available?)
• Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
• On the Independent Domination Number of Random Regular Graphs

This page was built for publication: Small edge dominating sets of regular graphs

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