2 citations · 2 across the 2 of their papers we have counts for
5 papers · 1 filter
Bounding the k-rainbow total domination number
Kerry Ojakian, Riste Skrekovski, Aleksandra Tepeh
Recently the notion of -rainbow total domination was introduced for a graph , motivated by a desire to reduce the problem of computing the total domination number of the gene…
Comparing the power of cops to zombies in pursuit-evasion games
David Offner, Kerry Ojakian
We compare two kinds of pursuit-evasion games played on graphs. In Cops and Robbers, the cops can move strategically to adjacent vertices as they please, while in a new variant, ca…
Three Graph Duals and A Bijection
Nikolaos Apostolakis, Kerry Ojakian
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in…
Capture-time Extremal Cop-Win Graphs
David Offner, Kerry Ojakian
We investigate extremal graphs related to the game of Cops and Robbers. We focus on graphs where a single cop can catch the robber; such graphs are called cop-win. The capture time…
Cop-Win Graphs: Optimal Strategies and Corner Rank
David Offner, Kerry Ojakian
We investigate the game of cops and robber, played on a finite graph, between one cop and one robber. If the cop can force a win on a graph, the graph is called cop-win. We describ…