B. Novick

activity

20152020

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020

The Threshold Strong Dimension of a Graph

Nadia Benakli, Novi H Bong, Shonda M. Dueck +3

Let $G$ be a connected graph and $u, v$ and $w$ vertices of $G$ . Then $w$ is said to {\em strongly resolve} $u$ and $v$ , if there is either a shortest $u$ - $w$ path that contains $v$ …

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…

math.CO2015

What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments

Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa

Moser asked for a construction of explicit tournaments on $n$ vertices having at least $(\frac{n}{3 e})^{n}$ Hamilton cycles. We show that he could have asked for rather more.