Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/3878
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPal, Hiranmoy-
dc.date.accessioned2023-01-07T11:24:59Z-
dc.date.available2023-01-07T11:24:59Z-
dc.date.issued2022-12-
dc.identifier.citation37th Annual Conference of Ramanujan Mathematical Society" ,06 - 08, December 2022en_US
dc.identifier.urihttp://hdl.handle.net/2080/3878-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractWe consider quantum state transfer relative to the Laplacian matrix of a graph. Let N (u) denote the set of all neighbors of a vertex u in a graph G. A pair of vertices u and v are called twin vertices of G provided N (u) \ {v} = N (v) \ {u}. We investigate the existence of quantum state transfer between a pair of twin vertices in a graph when the edge between the vertices is perturbed. We find that removal of any set of pairwise non-adjacent edges from a complete graph with a number of vertices divisible by 4 results Laplacian perfect state transfer (LPST) at π 2 between the end vertices of every edge removed. Further, we show that all Laplacian integral graphs with a pair of twin vertices exhibit LPST when the edge be- tween the vertices is perturbed. In contrast, we conclude that LPST can be achieved in every complete graph between the end vertices of any number of suitably perturbed non-adjacent edges. The results are further generalized to obtain a family of edge perturbed circulant graphs exhibiting Laplacian pretty good state transfer (LPGST) between twin vertices.en_US
dc.subjectQuantum state transferen_US
dc.subjectCirculant Graphen_US
dc.subjectSpectra of graphsen_US
dc.titleLaplacian State Transfer on Graphs with an Edge Perturbation Between Twin Verticesen_US
dc.typePresentationen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
PalH_RMS2022.pdf542.11 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.