3 citations · 5 across the 4 of their papers we have counts for
4 papers
Graceful labellings of variable windmills using Skolem sequences
Ahmad H. Alkasasbeh, Danny Dyer, Jared Howell
In this paper, we introduce graceful and near graceful labellings of several families of windmills. In particular, we use Skolem-type sequences to prove (near) graceful labellings…
The watchman's walk problem on directed graphs
Danny Dyer, Jared Howell, Brittany Pittman
In a graph, a watchman's walk is a minimum closed dominating walk. Given a graph and a single watchman, the length of a watchman's walk in (the watchman number) is denoted…
A note on watchman's walks in de Bruijn graphs
Danny Dyer, Jared Howell, Brittany Pittman
The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph o…
The Firebreak Problem
Kathleen D. Barnetson, Andrea C. Burgess, Jessica Enright +3
Suppose we have a network that is represented by a graph . Potentially a fire (or other type of contagion) might erupt at some vertex of . We are able to respond to this outb…