Show simple item record

dc.contributorDavidoff, Giulianaen_US
dc.contributorRobinson, Michaelen_US
dc.contributor.advisorPollatsek, Harrieten_US
dc.contributor.authorLastrina, Michelleen_US
dc.date.accessioned2011-02-16T13:47:13Z
dc.date.available2011-02-16T13:47:13Z
dc.date.issued2011-02-16
dc.date.submitted2006-06-29 19:25:59en_US
dc.identifier.urihttp://hdl.handle.net/10166/695
dc.description.abstractSeidel switching is a technique for generating pairs of graphs that are cospectral but not necessarily isomorphic. We will discuss and prove some important properties related to this graph construction. Cospectral pairs of regular graphs are rarer than cospectral pairs of non-regular graphs. As a result, after looking at how to construct graphs via the Seidel technique we will look specifically at generating regular pairs of graphs via the Seidel switching technique.en_US
dc.description.sponsorshipMathematicsen_US
dc.language.isoen_USen_US
dc.subjectseidel switchingen_US
dc.subjectgraph theoryen_US
dc.subjectgraph constructionen_US
dc.subjectcospectralen_US
dc.titleSeidel Switchingen_US
dc.typeThesisen_US
dc.date.gradyear2006en_US
mhc.institutionMount Holyoke Collegeen_US
mhc.degreeUndergraduateen_US
dc.rights.restrictedpublic


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record