On The Secure Domination of Mycielskian Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908898145861632 |
|---|---|
| author | Bhutani, Kiran R. Christiana, Anthony Ulrickson, Peter |
| author_facet | Bhutani, Kiran R. Christiana, Anthony Ulrickson, Peter |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17897 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On The Secure Domination of Mycielskian Graphs Bhutani, Kiran R. Christiana, Anthony Ulrickson, Peter Combinatorics 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. |
| title | On The Secure Domination of Mycielskian Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.17897 |