Weakly Connected Domination 

(Abstract)

Weakly connected domination is a graph parameter that is studied both for theoretical interest as well as applications in wireless ad hoc networks. In the last few years, several results in this area have been obtained by Magdalena Lemanska. In the talk, i will introduce the subject, some existing results, and present two new extensions of Lemanska's results on trees to cycle-disjoint graphs.

Mr. Ting Tao Siang is currently a graduate student of Math Department at NUS.