activity
20112026
most citedA bound for the distinguishing index of regular graphs

12 citations · 23 across the 23 of their papers we have counts for

collaborators
Showing math.PRShow all

1 paper · 1 filter

math.PR2022

Tipsy cop and tipsy robber: collisions of biased random walks on graphs

Pamela E. Harris, Erik Insko, Florian Lehner

Introduced by Harris, Insko, Prieto Langarica, Stoisavljevic, and Sullivan, the \emph{tipsy cop and drunken robber} is a variant of the cop and robber game on graphs in which the r…