Constructing Cospectral Graphs using Partitioned Tensor Product

dc.contributor.advisorM., Rajesh Kannanen_US
dc.contributor.authorWANKHEDE, HITESHen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.contributor.registration20161167en_US
dc.date.accessioned2021-09-09T04:03:44Z
dc.date.available2021-09-09T04:03:44Z
dc.date.issued2021-08en_US
dc.description.abstractThe goal in Spectral Graph Theory is to understand the structure of a graph using the spectrum of its associated matrices. This MS thesis is a contribution to the study of constructions of cospectral nonisomorphic graphs. We first generalize a construction based on partitioned tensor product introduced by Godsil and Mckay and discuss its particular cases. Then, we use the idea of taking partitioned tensor products to obtain new cospectral constructions from the existing ones. We also generalize the unfolding operation on the bipartite graph introduced by Butler, obtain its modifications, as well as introduce the notion of unfolding a multipartite graph to obtain cospectral nonisomorphic graphs.en_US
dc.identifier.citation130en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/6260
dc.language.isoenen_US
dc.subjectMathematicsen_US
dc.subjectSpectral Graph Theoryen_US
dc.titleConstructing Cospectral Graphs using Partitioned Tensor Producten_US
dc.typeThesisen_US
dc.type.degreeBS-MSen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ms_thesis_hitesh.pdf
Size:
2.46 MB
Format:
Adobe Portable Document Format
Description:
MS thesis

Collections