Reconfiguration is concerned with relationships among solutions to a problem instance,
where the reconfiguration of one solution to another is a sequence of steps such that each …

In graph theory, reconfiguration is concerned with relationships among solutions to a given
problem for a specific graph. The reconfiguration of one solution into another occurs via a …

For a graph $ G $, the $\gamma $-graph of $ G $, $ G (\gamma) $, is the graph whose
vertices correspond to the minimum dominating sets of $ G $, and where two vertices of $ G …

A paired dominating set of a graph G is a dominating set whose induced subgraph has a
perfect matching. The paired domination number γpr (G) of G is the minimum cardinality of a …

Let G be a graph. The gamma graph of G denoted by γ⋅ G is the graph with vertex set V (γ⋅
G) as the set of all γ-sets of G and two vertices D and S of γ⋅ G are adjacent if and only if …

A set S⊂ V is a dominating set of a graph G=(V, E) if every vertex v∈ V which does not
belong to S has a neighbour in S. The domination number γ (G) of the graph G is the …

For any graph parameter, the removal of a vertex from a graph can increase the parameter,
decrease the parameter, or leave the parameter unchanged. This dissertation focuses on …

The independent domination number $ i (G) $ of a graph $ G $ is the minimum cardinality of
a maximal independent set of $ G $, also called an $ i (G) $-set. The $ i $-graph of $ G …

A total dominating set for a graph G=(V (G), E (G)) is a subset D of V (G) such that every
vertex in V (G) is adjacent to some vertex in D. The total domination number of G, denoted by …

For any graph G=(V (G), E (G)), a nonempty subset D of V (G) is called an induced-paired
dominating set if every vertex in V (G) is adjacent to some vertex in D, and the induced …