Please use this identifier to cite or link to this item:
|Title:||Weakly Connected Domination||Authors:||TING TAO SIANG||Keywords:||weakly, connected, domination, disjoint, cycle, unique||Issue Date:||1-Mar-2010||Citation:||TING TAO SIANG (2010-03-01). Weakly Connected Domination. ScholarBank@NUS Repository.||Abstract:||Chapter 1 introduces the concept of weakly connected domination, a review of existing results and some relevant operations. Chapter 2 extends a known lower bound on the weakly connected domination number of trees to the more general class of cycle-disjoint graphs. Chapter 3 presents a characterisation of trees with unique minimum weakly connected dominating set. Chapter 4 determines the family of unicyclic graphs with unique weakly connected dominating set.||URI:||http://scholarbank.nus.edu.sg/handle/10635/17881|
|Appears in Collections:||Master's Theses (Open)|
Show full item record
Files in This Item:
|TingTS.pdf||251.03 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.