Recurrence among trees with most numerous efficient dominating sets

MaRDI QIDQ5387729zbMATH OpenFDO

Authors Dorota Bród, Zdzisław Skupień

Publication date 27 May 2008

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/87/showToc.html

zbMATH Keywords

efficient dominating set

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 4085682
• Efficient 2-domination in trees
• scientific article; zbMATH DE number 637297
• On the number of dominating sets in some classes of trees
• scientific article; zbMATH DE number 1409189

Cited in

(8)

• Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent
• Graphs with few total dominating sets
• Trees with minimum number of infima closed sets
• Majorization and the minimum number of dominating sets
• The number of maximum matchings in a tree
• scientific article; zbMATH DE number 1151809 (Why is no real title available?)
• Hereditary efficiently dominatable graphs
• Efficient 2-domination in trees

This page was built for publication: Recurrence among trees with most numerous efficient dominating sets

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