James M. Hammer

activity

20152021

most citedOn the Domination Number of Permutation Graphs and an Application to Strong Fixed Points

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2021

Distance in Latin Squares

Omar Aceval, Paige Beidelman, Jieqi Di +4

A Latin square of order $n$ is an $n \times n$ array which contains $n$ distinct symbols exactly once in each row and column. We define the adjacent distance between two adjacent ce…

math.CO2018★ 1 cited

On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points

Theresa Baren, Michael Cory, Mia Friedberg +6

A permutation graph $G_{π}$ is a simple graph with vertices corresponding to the elements of $π$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $π$ . A set of vertic…

math.CO2016

Decomposition of a complete bipartite multigraph into arbitrary cycle sizes

John Asplund, Joe Chaffee, James Hammer

In a graph $G$ , let $μ_{G} (x y)$ denote the number of edges between $x$ and $y$ in $G$ . Let $λ K_{v, u}$ be the graph $(V \cup U, E)$ with $∣ V ∣ = v$ , $∣ U ∣ = u$ , and \[ μ_G(xy)=\begin{cases} λ…

math.CO2015

Packing paths in a $(λ + μ) K_{v + u} - λ K_{v}$

John Asplund, Joe Chaffee, James M. Hammer

Following standard terminology, $λ K_{v}$ is a multigraph on $v$ vertices such that $λ$ edges join each pair of vertices. Let $(λ + μ) K_{v + u} - λ K_{v}$ be the graph $(V \cup U, E)$ with $|V|=…

Distance in Latin Squares

On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points

Decomposition of a complete bipartite multigraph into arbitrary cycle sizes

Packing paths in a (λ+μ)Kv+u​−λKv​

Packing paths in a $(λ + μ) K_{v + u} - λ K_{v}$