Dominating vortex covers: The vertex-edge domination problem

William F. Klostermeyer, Margaret Ellen Messinger, Anders Yeo

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

The vertex-edge domination number of a graph, gamma(ve) (G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D. This is motivated by the problem of determining how many guards are needed in a graph so that a searchlight can be shone down each edge by a guard either incident to that edge or at most distance one from a vertex incident to the edge. Our main result is that for any cubic graph G with n vertices, gamma(ve) (G)
OriginalsprogEngelsk
TidsskriftDiscussiones Mathematicae. Graph Theory
Vol/bind41
Udgave nummer1
Sider (fra-til)123-132
ISSN1234-3099
DOI
StatusUdgivet - 2021

Fingeraftryk Dyk ned i forskningsemnerne om 'Dominating vortex covers: The vertex-edge domination problem'. Sammen danner de et unikt fingeraftryk.

Citationsformater