Show simple item record

dc.contributor.authorCameron, Ben
dc.date.accessioned2014-08-19T14:47:33Z
dc.date.available2014-08-19T14:47:33Z
dc.date.issued2014-08-19
dc.identifier.urihttp://hdl.handle.net/10222/53946
dc.description.abstractWe define the P -generating polynomial for a graph G and property P as the generating polynomial for the number of P-subgraphs of G of each size. This polynomial is a generalization of the independence polynomial and so results for the independence polynomial are generalized to hold for properties other than independence. We look at computing the P -generating polynomial of product graphs for certain properties P. We then look at determining the nature and location of the roots of P-generating polynomials in general, showing for which properties the roots are real for all graphs. The roots of the P-generating polynomials of graph products lead to the P-fractal of a graph for all properties P that are closed under graph substitution.en_US
dc.language.isoen_USen_US
dc.subjectGraph theoryen_US
dc.subjectPolynomialsen_US
dc.titleP-Generating Polynomials and the P-Fractal of a Graphen_US
dc.date.defence2014-08-11
dc.contributor.departmentDepartment of Mathematics & Statistics - Math Divisionen_US
dc.contributor.degreeMaster of Scienceen_US
dc.contributor.external-examinern/aen_US
dc.contributor.graduate-coordinatorDr. Sara Faridien_US
dc.contributor.thesis-readerDr. Jeannette Janssenen_US
dc.contributor.thesis-readerDr. Richard Nowakowskien_US
dc.contributor.thesis-supervisorDr. Jason 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