J. Asplund

activity

20152025

most citedA Vizing-type result for semi-total domination

15 citations · 64 across the 24 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017★ 1 cited

The k-planar crossing number of random graphs and random regular graphs

John Asplund, Thao Do, Arran Hamm +3

We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph $G (n, p)$ . In particular, we show that the k-planar crossing number…

math.CO2017★ 3 cited

Minimum Coprime Labelings for Operations on Graphs

John Asplund, N. Bradley Fox

A prime labeling of a graph of order $n$ is a labeling of the vertices with the integers $1$ to~ $n$ in which adjacent vertices have relatively prime labels. A coprime labeling main…

math.CO2017

Reconfiguration graphs of shortest paths

John Asplund, Kossi Edoh, Ruth Haas +3

For a graph $G$ and $a, b \in V (G)$ , the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S (G, a, b)$ . The vertex set of $S (G, a, b)$ is the set of a…