๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Trees having many minimal dominating sets

โœ Scribed by Krzywkowski, Marcin

Book ID
120245118
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
148 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Universal minimal total dominating funct
Universal minimal total dominating functions of trees
โœ Alan Stacey ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 179 KB

We show that any tree that has a universal minimal total dominating function has one which only takes 0-1 values. K 3 demonstrates that this fails for graphs in general. Given a graph G =(V, E), for each vertex ve V let F(v) be the set of its neighbours (in particular, not including v itself). A to

Convexity of minimal dominating function
Convexity of minimal dominating functions of trees โ€” II
โœ E.J. Cockayne; G. MacGillivray; C.M. Mynhardt ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

The relation Ye on the set of minimal dominating functions (MDFs) of a finite graph G is defined by f&?g if and only if any convex combination off and g is also an MDF. If fis a nonintegral MDF of a tree, the existence of another MDF with fewer nonintegral values and other desirable properties is es

Dominating sets whose closed stars form
Dominating sets whose closed stars form spanning trees
โœ Jerrold W. Grossman ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

For a subset W of vertices of an undirected graph G, let S(W) be the subgraph consisting of W, all edges incident to at least one vertex in W, and all vertices adjacent to at least one vertex in W. If there exists a W such that S(W) is a tree containing all the vertices of G, then S(W) is a spanning