5 citations · 11 across the 8 of their papers we have counts for
4 papers · 1 filter
On k-Total Dominating Graphs
Saeid Alikhani, Davood Fatehi, Kieka Mynhardt
For a graph G, the k-total dominating graph D_{k}^{t}(G) is the graph whose vertices correspond to the total dominating sets of G that have cardinality at most k; two vertices of D…
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…
Broadcasts in Graphs: Diametrical Trees
L. Gemmrich, C. M. Mynhardt
A dominating broadcast on a graph G with vertex set V is a function f that maps V to {0,1,...,diam(G)} such that f(v) does not exceed e(v) (the eccentricity of v) for all vertices…
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…