3 citations · 8 across the 13 of their papers we have counts for
15 papers
A Discrete Logarithm Construction for Orthogonal Double Covers of the Complete Graph by Hamiltonian Paths
M. A. Ollis
During their investigation of power-sequence terraces, Anderson and Preece briefly mention a construction of a terrace for the cyclic group when is odd and $2n+1…
Construction Techniques for Linear Realizations of Multisets with Small Support
Onur Ağırseven, M. A. Ollis
A Hamiltonian path in the complete graph whose vertices are labeled with the integers is a linear realization for the multiset of the linear edge-lengths…
A Coprime Buratti-Horak-Rosa Conjecture and Grid-Based Linear Realizations
Onur Agirseven, M. A. Ollis
We propose a "Coprime Buratti-Horak-Rosa (BHR) Conjecture": If is a multiset of size with support contained in such that $\gcd(v,x…
Grid-Based Graphs, Linear Realizations and the Buratti-Horak-Rosa Conjecture
Onur Agirseven, M. A. Ollis
Label the vertices of the complete graph with the integers and define the {\em length} of the edge between distinct vertices labeled and $y…
A Comment on Dean's Construction of Prime Labelings on Ladders
Stephen J. Curran, M. A. Ollis
A prime labeling on a graph of order is an assignment of to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The l…
Sequencings in Semidirect Products via the Polynomial Method
Simone Costa, Stefano Della Fiore, M. A. Ollis
The partial sums of a sequence of distinct non-identity elements of a group are and for $0…
On Sequences in Cyclic Groups with Distinct Partial Sums
Simone Costa, Stefano Della Fiore, M. A. Ollis +1
A subset of an abelian group is {\em sequenceable} if there is an ordering of its elements such that the partial sums , given by $y_0…
The Buratti-Horak-Rosa Conjecture Holds for Some Underlying Sets of Size Three
Pranit Chand, M. A. Ollis
The Buratti-Horak-Rosa Conjecture concerns the possible multisets of edge-labels of a Hamiltonian path in the complete graph with vertex labels under a partic…
Growable Realizations: a Powerful Approach to the Buratti-Horak-Rosa Conjecture
M. A. Ollis, Anita Pasotti, Marco A. Pellegrini +1
Label the vertices of the complete graph with the integers and define the length of the edge between and to be .…
Roman and Vatican Crossover Designs
M. A. Ollis
Latin squares with a balance property among adjacent pairs of symbols---being "Roman" or "row-complete"---have long been used as uniform crossover designs with the number of treatm…
Sequences in Dihedral Groups with Distinct Partial Products
M. A. Ollis
Given a subset of the non-identity elements of the dihedral group of order , is it possible to order the elements of so that the partial products are distinct? This is…
The spectrum of group-based Latin squares
M. A. Ollis, Christopher R. Tripp
We construct sequencings for many groups that are a semi-direct product of an odd-order abelian group and a cyclic group of odd prime order. It follows from these constructions tha…
Distinct Partial Sums in Cyclic Groups: Polynomial Method and Constructive Approaches
Jacob Hicks, M. A. Ollis, John. R. Schmitt
Let be an abelian group and consider a subset with . Given an ordering of the elements of , define its {\em partial sums} by…
Infinite Latin Squares: Neighbor Balance and Orthogonality
Anthony B. Evans, Gage N. Martin, Kaethe Minden +1
Regarding neighbor balance, we consider natural generalizations of -complete Latin squares and Vatican squares from the finite to the infinite. We show that if is an infinit…
Terraces for Small Groups
M. A. Ollis
We use heuristic algorithms to find terraces for small groups. We show that Bailey's Conjecture (that all groups other than the non-cyclic elementary abelian 2-groups are terraced)…