Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Is there any code to list all minimal k-distance dominating sets of a simple graph G in sagemath?

A distance- k-dominating set S of a graph G is a set of its vertices of minimal cardinality such that any vertex of G is in S or is at distance at most k from a vertex in S.

I need to find all minimal distance 2- dominating sets of a simple graph G.