4 citations · 12 across the 10 of their papers we have counts for
16 papers
Universal rooted phylogenetic tree shapes and universal tanglegrams
Ann Clifton, Eva Czabarka, Kevin Liu +4
We provide an lower bound and an upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted b…
Symmetry Parameters of Two-Generator Circulant Graphs
Sally Cockburn, Sarah Loeb
The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism gr…
Symmetry Parameters of Various Hypercube Families
Debra Boutin, Sally Cockburn, Lauren Keough +2
In this paper we study the symmetry parameters determining number, distinguishing number, and cost of 2-distinguishing, for some variations on hypercubes, namely Hamming graphs, po…
Strategy-indifferent games of best choice
Brant Jones, Katelynn D. Kochalski, Sarah Loeb +1
The game of best choice (or "secretary problem") is a model for making an irrevocable decision among a fixed number of candidate choices that are presented sequentially in random o…
Symmetry Parameters for Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
The Mycielskian construction, denoted , takes a finite simple graph to a larger graph with of the same clique number but larger chromatic number. The generalized Mycielsk…
Determining Number and Cost of Generalized Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
A set of vertices is a determining set for a graph if every automorphism of is uniquely determined by its action on . The size of a smallest determining set for …