A subset $S\subseteq V(G)$ is a simultaneous dominating set of $G$ if it is a dominating set in every spanning tree in $\mathcal{F}$. We consider the problem of ...
A subset S⊆ V(G) is a simultaneous dominating set of G if it is a dominating set in every spanning tree in F. We consider the problem of finding a minimum size ...
Sep 19, 2021 · Abstract. We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, ...
Missing: Factorings. | Show results with:Factorings.
A subset S ⊆ V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a factor total dominating set if in every Fi ...
This paper presents an improved enumeration algorithm to give out all real Pareto optimal solutions for the mc-MST problem.
Aug 7, 2018 · Abstract. Given an undirected graph on a node set V and positive integers k and m, a k-connected m-dominating set ((k, m)-CDS) is defined as ...
Apr 11, 2006 · Let F1,F2,...,Fk be graphs with the same vertex set V . A subset S ⊆ V is a factor dominating set if in every Fi every vertex not in S is ...
Missing: Spanning Tree
[PDF] High degree graphs contain large-star factors - Princeton Math
web.math.princeton.edu › stars17
Given a graph G = (V,E) with minimum degree d, we wish to define a dominating set C ⊂ V whose members will form the centers of the star factor, and then to ...
Abstract—We study the cost of distributed MST con- struction in the setting where each edge has a latency and a capacity, along with the weight.
Simultaneous Dominating Set for Spanning Tree Factorings. For a connected graph G we call a set F a spanning tree factoring of G i... 0 Sebastian S ...