AI Chat AI Image Generator AI Video Text to Speech

Linear algorithms on Steiner domination of trees

04/14/2019

∙

by Chenglin Gao, et al.

∙

∙

A set of vertices W in a connected graph G is called a Steiner dominating set if W is both Steiner and dominating set. The Steiner domination number γ_st(G) is the minimum cardinality of a Steiner dominating set of G. A linear algorithm is proposed in this paper for finding a minimum Steiner dominating set for a tree T.

Chenglin Gao
1 publication
Chengye Zhao
2 publications

page 1

page 2

page 3

page 4

research

∙ 04/01/2019

Complexity and Algorithms for Semipaired Domination in Graphs

For a graph G=(V,E) with no isolated vertices, a set D⊆ V is called a se...

0 Michael A. Henning, et al. ∙

research

∙ 12/10/2020

A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph

Given a graph G=(V,E) and an integer k ≥ 1, a k-hop dominating set D of ...

0 A. Karim Abu-Affash, et al. ∙

research

∙ 05/07/2018

Domination Cover Number of Graphs

A set D ⊆ V for the graph G=(V, E) is called a dominating set if any ver...

0 M. Alambardar Meybodi, et al. ∙

research

∙ 02/13/2018

Hardness Results and Approximation Algorithms for the Minimum Dominating Tree Problem

Given an undirected graph G = (V, E) and a weight function w:E →R, the M...

0 Gilad Kutiel, et al. ∙

research

∙ 06/28/2022

On Relaxation of Dominant Sets

In a graph G = (V,E), a k-ruling set S is one in which all vertices V S ...

0 Max Koster, et al. ∙

research

∙ 03/31/2022

Minimum Roman Dominating Distance Energy of a Graph

In this correspondence, we introduced the concept of minimum roman domin...

0 Lakshmanan R, et al. ∙

research

∙ 03/02/2022

Weighted domination models and randomized heuristics

We consider the minimum weight and smallest weight minimum-size dominati...

0 Lukas Dijkstra, et al. ∙