Metraipolis › archive › dc_6dc540ad77ea

On the (independent) semitotal domination in subdivision, middle, and central graphs — arXiv:2609.33932

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33932
License (as archived)
CC0-1.0
Archived
2026-10-07T23:29:10.308Z
SHA-256 of the archived text
c89bab573aa86c45b41cc2632c7d1f534b8c3a9a277ebed0f5eb6480875e4f70
Stable URL of this page
https://metraipolis.com/documento/dc_6dc540ad77ea

How to cite

On the (independent) semitotal domination in subdivision, middle, and central graphs — arXiv:2609.33932 — arXiv (en), https://arxiv.org/abs/2609.33932 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6dc540ad77ea (Metraipolis archive dc_6dc540ad77ea, sha256 c89bab573aa86c45b41cc2632c7d1f534b8c3a9a277ebed0f5eb6480875e4f70)
BibTeX
@misc{dc6dc540ad77ea,
  title = {On the (independent) semitotal domination in subdivision, middle, and central graphs — arXiv:2609.33932},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33932},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6dc540ad77ea; sha256 c89bab573aa86c45b41cc2632c7d1f534b8c3a9a277ebed0f5eb6480875e4f70},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33932. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A dominating set $D$ of a nontrivial connected graph $G$ is called a semitotal dominating set of $G$ if every vertex in $D$ is at distance at most two from another vertex in $D$. If, in addition, $D$ is an independent set, then $D$ is called an independent semitotal dominating set of $G$. The (independent) semitotal domination number of $G$ is the minimum cardinality among all (independent) semitotal dominating sets of $G$. In this paper, we obtain closed formulas for these parameters in the following three well-known graph operators defined from a connected graph: the subdivision, middle, and central graphs.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.33932 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:08:10.834Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).