Linear algorithms on Steiner domination of trees

MaRDI QIDQ6317177zbMATH OpenFDO

Authors Yueming Shen, Chengye Zhao, Chenglin Gao, Yunfang Tang

Publication date 14 April 2019

Abstract: 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 $gamm{a}_{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$.

This page was built for publication: Linear algorithms on Steiner domination of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317177)