Show simple item record

dc.contributor.authorBeaton, Iain
dc.date.accessioned2017-08-18T14:23:01Z
dc.date.available2017-08-18T14:23:01Z
dc.identifier.urihttp://hdl.handle.net/10222/73123
dc.description.abstractA dominating set S of a graph G of order n is a subset of the vertices of G such that every vertex is either in S or adjacent to a vertex of S. The domination polynomial of G, denoted D(G, x), is the generating polynomial for the number of dominating sets in G of each size. Two graphs G and H are considered D- equivalent if D(G, x) = D(H, x). The equivalence class of G, denoted [G], is the set of all graphs D-equivalent to G. We provide some results on constructing D-equivalent graphs as well as determine the equivalence class of paths. We also explore some bounds on the coefficients of D(G, x) for a given graph, and for some families of graphs. We conclude with a few open problems and possible research directions.en_US
dc.language.isoen_USen_US
dc.subjectDominationen_US
dc.subjectDomination Polynomialen_US
dc.subjectGraph Theoryen_US
dc.titleDOMINATION POLYNOMIALS: A BRIEF SURVEY AND ANALYSISen_US
dc.date.defence2017-08-02
dc.contributor.departmentDepartment of Mathematics & Statistics - Math Divisionen_US
dc.contributor.degreeMaster of Scienceen_US
dc.contributor.external-examinern/aen_US
dc.contributor.graduate-coordinatorDavid Ironen_US
dc.contributor.thesis-readerJeanette Janssenen_US
dc.contributor.thesis-readerRichard Nowakowskien_US
dc.contributor.thesis-supervisorJason Brownen_US
dc.contributor.ethics-approvalNot Applicableen_US
dc.contributor.manuscriptsNot Applicableen_US
dc.contributor.copyright-releaseNot Applicableen_US
 Find Full text

Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record