activity
20092015
most citedFast clique minor generation in Chimera qubit connectivity graphs

13 citations · 34 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2015★ 1 cited

The 4-Regular Edge-Transitive Graphs of Girth 4

Tomas Boothby, Matt DeVos

This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional gra…

math.CO2015★ 1 cited

An algebraic approach to enumerating non-equivalent double traces in graphs

Nino Bašić, Drago Bokal, Tomas Boothby +1

Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the u…

math.CO2015★ 3 cited

Tight Heffter Arrays Exist for all Possible Values: The Research Report

Dan S. Archdeacon, Tomas Boothby, Jeffrey H. Dinitz

A tight Heffter array H(m,n) is an m x n matrix with nonzero entries from Z_{2mn+1} such that i) the sum of the elements in each row and each column is 0, and ii) no element from {…

cs.DM2015★ 13 cited

Fast clique minor generation in Chimera qubit connectivity graphs

Kelly Boothby, Andrew D. King, Aidan Roy

The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a {\e…

math.CO2013★ 4 cited

A New Proof of Kemperman's Theorem

Tomas Boothby, Matt DeVos, Amanda Montejano

Let be an additive abelian group and let be finite and nonempty. The pair is called critical if the sumset $A+B = {a+b \mid $a \in Ab\in B$}$ s…

math.CO2012

On the Cyclically Fully Commutative Elements of Coxeter Groups

Tomas Boothby, Jeffrey Burkert, Morgan Eichwald +3

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that…