On The Secure Domination of Mycielskian Graphs
Combinatorics
2026-03-19 v1
Abstract
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.
Cite
@article{arxiv.2603.17897,
title = {On The Secure Domination of Mycielskian Graphs},
author = {Kiran R. Bhutani and Anthony Christiana and Peter Ulrickson},
journal= {arXiv preprint arXiv:2603.17897},
year = {2026}
}
Comments
15 pages