An equivalence theorem links perfect state transfer between pair states in an involution-equipped graph to transfer in the induced subgraph, enabling explicit constructions for almost all planar graphs, trees, and certain paths via added loops or edges.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Laplacian state transfer in graphs with involutions
An equivalence theorem links perfect state transfer between pair states in an involution-equipped graph to transfer in the induced subgraph, enabling explicit constructions for almost all planar graphs, trees, and certain paths via added loops or edges.