Dominating Sets of the Cartesian Products of Cycles
| dc.contributor.author | Assadian, Navid | |
| dc.contributor.supervisor | Myrvold, Wendy | |
| dc.date.accessioned | 2019-04-16T23:38:01Z | |
| dc.date.available | 2019-04-16T23:38:01Z | |
| dc.date.copyright | 2019 | en_US |
| dc.date.issued | 2019-04-16 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | A dominating set for a graph G is a subset D of V(G) such that every vertex not in D is adjacent to at least one member of D. In this project, we first briefly survey a variety of known results on dominating sets of some families of graphs, especially the Cartesian products of two k-cycles which are our main focus for this project. Then, we describe the application we developed to facilitate research on dominating sets of the Cartesian products of k-cycles. After that, we obtain linear-time algorithms to generate dominating sets of the Cartesian products of two k-cycles with sizes matching the best known upper bounds. Additionally, for two cases when k is congruent to two or three modulo five, we improve the two known upper bounds. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/10716 | |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | Dominating Sets | en_US |
| dc.subject | The Cartesian Products | en_US |
| dc.subject | Graph Theory | en_US |
| dc.title | Dominating Sets of the Cartesian Products of Cycles | en_US |
| dc.type | project | en_US |