2 citations · 6 across the 6 of their papers we have counts for
7 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…
Graceful Labellings of Various Cyclic Snakes
Ahmad H. Alkasasbeh, Danny Dyer
In this paper, we present a new sufficiency condition to obtain a graceful labelling for every snake and use this condition to label every such snake for …
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…
Applying Skolem Sequences to Gracefully Label New Families of Triangular Windmills
Ahmad H. Alkasasbeh, Danny Dyer, Nabil Shalaby
A function is a \textit{graceful labelling} of a graph with edges if is an injection such that each edge is assigned…
Limited Visibility Cops and Robbers
N. E. Clarke, D. Cox, C. Duffy +3
We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter . We consider the basic…