26 citations
7 papers
New Perspectives on Neighborhood-Prime Labelings of Graphs
John Asplund, N. Bradley Fox, Arran Hamm
Neighborhood-prime labeling is a variation of prime labeling. A labeling is a neighborhood-prime labeling if for each vertex with degree greater t…
On the k-planar local crossing number
John Asplund, Thao do, Arran Hamm +1
Given a fixed positive integer , the -planar local crossing number of a graph , denoted by , is the minimum positive integer such that can be deco…
Multiplicative Invariants of Root Lattices
Jessica Hamm
We describe the multiplicative invariant algebras of the root lattices of all irreducible root systems under the action of the Weyl group. In each case, a finite system of fundamen…
Invariant Based Quartet Puzzling
Joe Rusinko, Brian Hipp
Traditional Quartet Puzzling algorithms use maximum likelihood methods to reconstruct quartet trees, and a puzzling algorithm to combine these quartets into a tree for the full col…
Commutation classes of double wiring diagrams
Patrick Dukes, Joe Rusinko
We describe a new method for computing the graph of commutation classes of double wiring diagrams. Using these methods we compute the graph for five strings or less which allows us…
Connection Formulae for Asymptotics of Solutions of the Degenerate Third Painlevé Equation. I
A. V. Kitaev, A. H. Vartanian
The degenerate third Painlevé equation, , where $ε,b \in \mathbb…