Dominating Sets of the Cartesian Products of Cycles

dc.contributor.authorAssadian, Navid
dc.contributor.supervisorMyrvold, Wendy
dc.date.accessioned2019-04-16T23:38:01Z
dc.date.available2019-04-16T23:38:01Z
dc.date.copyright2019en_US
dc.date.issued2019-04-16
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en_US
dc.description.abstractA 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.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/10716
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectDominating Setsen_US
dc.subjectThe Cartesian Productsen_US
dc.subjectGraph Theoryen_US
dc.titleDominating Sets of the Cartesian Products of Cyclesen_US
dc.typeprojecten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Assadian_Navid_MSc_2019.pdf
Size:
1.21 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: