Simultaneously dominating all spanning trees of a graph

Simultaneously dominating all spanning trees of a graph

<p class="p1">We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover. Using this fact we present an exact...

Full description

Bibliographic Details
Main Authors: Sebastian Johann, Sven O. Krumke, Manuel Streicher
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-03-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
dominating set, simultaneous domination, factor domination
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/1272

Internet

https://www.ejgta.org/index.php/ejgta/article/view/1272

Similar Items