UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Constructing Cospectral and Comatching Graphs

dc.contributor.authorWang, Xiaojing
dc.date.accessioned2019-07-18T14:25:02Z
dc.date.available2019-07-18T14:25:02Z
dc.date.issued2019-07-18
dc.date.submitted2019-07-15
dc.description.abstractThe matching polynomial is a graph polynomial that does not only have interesting mathematical properties, but also possesses meaningful applications in physics and chemistry. For a simple graph, the matching polynomial enumerates the number of matchings of different sizes in it. Two graphs are comatching if they have the same matching polynomial. Two vertices u, v in a graph G are comatching if G\ u and G\ v are comatching. In 1973, Schwenk proved almost every tree has the same characteristic polynomial with another tree. In this thesis, we extend Schwenk's result to maximal limbs and weighted trees. We also give a construction using 1-vertex extensions for comatching graphs and graphs with an arbitrarily large number of comatching vertices. In addition, we use an alternative definition of matching polynomial for multigraphs to derive new identities for the matching polynomial. These identities are tools used towards our 2-sum construction for comatching vertices and comatching graphs.en
dc.identifier.urihttp://hdl.handle.net/10012/14808
dc.language.isoenen
dc.pendingfalse
dc.publisherUniversity of Waterlooen
dc.subjectmatching polynomialen
dc.subjectcomatchingen
dc.subjectcospectralen
dc.subjectgraph theoryen
dc.subjectalgebraic graph theoryen
dc.titleConstructing Cospectral and Comatching Graphsen
dc.typeDoctoral Thesisen
uws-etd.degreeDoctor of Philosophyen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degree.disciplineCombinatorics and Optimizationen
uws-etd.degree.grantorUniversity of Waterlooen
uws.contributor.advisorGodsil, Chris
uws.contributor.affiliation1Faculty of Mathematicsen
uws.peerReviewStatusUnrevieweden
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

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