J. Wisby

most citedTotal

k

-domination in Cartesian product of complete graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2024

Online Ramsey numbers of ordered graphs

Emily Heath, Dylan King, Grace McCourt +2

The online ordered Ramsey game is played between two players, Builder and Painter, on an infinite sequence of vertices with ordered graphs $(G_{1}, G_{2})$ , which have linear orderings…

math.CO2020★ 1 cited

Total $k$ -domination in Cartesian product of complete graphs

Walter Carballosa, Justin Wisby

Let $G = (V, E)$ be a finite undirected graph. A set $S$ of vertices in $V$ is said to be total $k$ -dominating if every vertex in $V$ is adjacent to at least $k$ vertices in $S$ . The…

Online Ramsey numbers of ordered graphs

Total k-domination in Cartesian product of complete graphs

Total $k$ -domination in Cartesian product of complete graphs