EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Distance Domination in Vertex Partitioned Graphs

Allan Frendrup, Zsolt Tuza, Preben Dahl Vestergaard

Mathematica Pannonica · 2022

DOI: 10.1556/314.2022.00006 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematica Pannonica, 2022. Verfasst von Allan Frendrup und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We treat a variation of graph domination which involves a partition ( V 1 , V 2 ,..., V k ) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables. Further, we compare a high number of partition classes and the number of dominators needed.

Zitieren

APA

Frendrup, A., Tuza, Z., & Vestergaard, P. D. (2022). Distance Domination in Vertex Partitioned Graphs. Mathematica Pannonica. https://doi.org/10.1556/314.2022.00006

Vancouver

Frendrup A, Tuza Z, Vestergaard PD. Distance Domination in Vertex Partitioned Graphs. Mathematica Pannonica. 2022. doi:10.1556/314.2022.00006

BibTeX
@article{Frendrup2022,
  author = {Frendrup, Allan and Tuza, Zsolt and Vestergaard, Preben Dahl},
  title = {Distance Domination in Vertex Partitioned Graphs},
  journal = {Mathematica Pannonica},
  year = {2022},
  doi = {10.1556/314.2022.00006}
}
Kostenlos starten →