Unique paired vs edge-vertex minimum dominating sets in trees

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Miotk, Mateusz, Zakrzewski, Michał, Żyliński, Paweł
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915640858640384
author Miotk, Mateusz
Zakrzewski, Michał
Żyliński, Paweł
author_facet Miotk, Mateusz
Zakrzewski, Michał
Żyliński, Paweł
contents We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.
format Preprint
id arxiv_https___arxiv_org_abs_2503_11996
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Unique paired vs edge-vertex minimum dominating sets in trees
Miotk, Mateusz
Zakrzewski, Michał
Żyliński, Paweł
Combinatorics
05C05, 05C69
We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.
title Unique paired vs edge-vertex minimum dominating sets in trees
topic Combinatorics
05C05, 05C69
url https://arxiv.org/abs/2503.11996