3 citations · 5 across the 4 of their papers we have counts for
5 papers
On Products of Strong Skolem Starters
Oleg Ogandzhanyants, Margarita Kondratieva, Nabil Shalaby
In 1991, Shalaby conjectured that any , where or , admits a strong Skolem starter. In 2018, the authors explicitly constructed some…
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…
Strong Skolem Starters
Oleg Ogandzhanyants, Margarita Kondratieva, Nabil Shalaby
This paper concerns a class of combinatorial objects called Skolem starters, and more specifically, strong Skolem starters, which are generated by Skolem sequences. In 1991, Shalab…
Cyclic, Simple and Indecomposable Three-fold Triple Systems
Nabil Shalaby, Bradley Sheppard, Daniela Silvesan
In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-ty…
The intersection spectrum of Skolem sequences and its applications to lambda fold cyclic triple systems, together with the Supplement
Nabil Shalaby, Daniela Silvesan
A Skolem sequence of order n is a sequence S_n=(s_{1},s_{2},...,s_{2n}) of 2n integers containing each of the integers 1,2,...,n exactly twice, such that two occurrences of the int…