2 citations · 3 across the 5 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 1 cited
Connected k-Dominating Graphs
C. M. Mynhardt, R. Roux, L. E. Teshima
For a graph G=(V,E), the k-dominating graph of G, denoted by , has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of…
math.CO2017★ 2 cited
A note on some variations of the -graph
C. M. Mynhardt, L. E. Teshima
For a graph , the -graph of , , is the graph whose vertices correspond to the minimum dominating sets of , and where two vertices of are adjacent if and on…