On The Secure Domination of Mycielskian Graphs

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 Mycielskians of important families of graphs, and construct families of graphs realizing particular values of (secure) domination parameters.