Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/17881
DC Field | Value | |
---|---|---|
dc.title | Weakly Connected Domination | |
dc.contributor.author | TING TAO SIANG | |
dc.date.accessioned | 2010-08-17T18:00:04Z | |
dc.date.available | 2010-08-17T18:00:04Z | |
dc.date.issued | 2010-03-01 | |
dc.identifier.citation | TING TAO SIANG (2010-03-01). Weakly Connected Domination. ScholarBank@NUS Repository. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/17881 | |
dc.description.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. | |
dc.language.iso | en | |
dc.subject | weakly, connected, domination, disjoint, cycle, unique | |
dc.type | Thesis | |
dc.contributor.department | MATHEMATICS | |
dc.contributor.supervisor | KOH KHEE MENG | |
dc.description.degree | Master's | |
dc.description.degreeconferred | MASTER OF SCIENCE | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Master's Theses (Open) |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
TingTS.pdf | 251.03 kB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.