3 papers
math.CO2023
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets
Richard Brewster, Kieka Mynhardt, Laura Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of is the graph…
math.CO2023
The -Graphs of Paths and Cycles
R. C. Brewster, C. M. Mynhardt, L. E. Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of , denoted $\m…
math.CO2023
Reconfiguration of Minimum Independent Dominating Sets in Graphs
R. C. Brewster, C. M. Mynhardt, L. E. Teshima
The independent domination number of a graph is the minimum cardinality of a maximal independent set of , also called an -set. The -graph of , denoted $\m…