TY - JOUR

T1 - Reconfiguration of dominating sets

AU - Suzuki, Akira

AU - Mouawad, Amer E.

AU - Nishimura, Naomi

N1 - Funding Information:
Research supported by JSPS Grant-in-Aid for Scientific Research, Grant Number 26730001, and the Natural Science and Engineering Research Council of Canada.
Publisher Copyright:
© 2015, Springer Science+Business Media New York.

PY - 2016/11/1

Y1 - 2016/11/1

N2 - We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph G is a set S of vertices such that each vertex is either in S or has a neighbour in S. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions s and t such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex. For various values of k, we consider properties of Dk(G) , the graph consisting of a node for each dominating set of size at most k and edges specified by the adjacency relation. Addressing an open question posed by Haas and Seyffarth, we demonstrate that DΓ ( G ) + 1(G) is not necessarily connected, for Γ(G) the maximum cardinality of a minimal dominating set in G. The result holds even when graphs are constrained to be planar, of bounded tree-width, or b-partite for b≥ 3. Moreover, we construct an infinite family of graphs such that Dγ ( G ) + 1(G) has exponential diameter, for γ(G) the minimum size of a dominating set. On the positive side, we show that Dn - μ(G) is connected and of linear diameter for any graph G on n vertices with a matching of size at least μ+ 1.

AB - We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph G is a set S of vertices such that each vertex is either in S or has a neighbour in S. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions s and t such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex. For various values of k, we consider properties of Dk(G) , the graph consisting of a node for each dominating set of size at most k and edges specified by the adjacency relation. Addressing an open question posed by Haas and Seyffarth, we demonstrate that DΓ ( G ) + 1(G) is not necessarily connected, for Γ(G) the maximum cardinality of a minimal dominating set in G. The result holds even when graphs are constrained to be planar, of bounded tree-width, or b-partite for b≥ 3. Moreover, we construct an infinite family of graphs such that Dγ ( G ) + 1(G) has exponential diameter, for γ(G) the minimum size of a dominating set. On the positive side, we show that Dn - μ(G) is connected and of linear diameter for any graph G on n vertices with a matching of size at least μ+ 1.

KW - Connectivity

KW - Diameter

KW - Dominating set

KW - Reconfiguration

KW - Reconfiguration graph

KW - Solution space

UR - http://www.scopus.com/inward/record.url?scp=84940099525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940099525&partnerID=8YFLogxK

U2 - 10.1007/s10878-015-9947-x

DO - 10.1007/s10878-015-9947-x

M3 - Article

AN - SCOPUS:84940099525

VL - 32

SP - 1182

EP - 1195

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 4

ER -