4 papers
On The Secure Domination of Mycielskian Graphs
Kiran R. Bhutani, Anthony Christiana, Peter Ulrickson
We study the secure domination number of the Mycielskian graph of a simple, connected, undirected graph. We give generally applicable bounds, compute secure domination numbers for…
Autonomous Domination
Peter Ulrickson
The well-known notion of domination in a graph abstracts the idea of protecting locations with guards. This paper introduces a new graph invariant, the autonomous domination number…
Supersymmetric Euclidean Field Theories and K-theory
Peter Ulrickson
We construct spaces of 1-dimensional supersymmetric Euclidean field theories and show that they represent real or complex K-theory. A noteworthy feature of our bordism category is…
Endofunctors of Quandles and Racks
Peter Ulrickson
We show that the only endofunctors of the category of quandles commuting with the forgetful functor to sets are the power operations. We also give a similar statement for racks.