Abstract
A meteor graph is a connected graph with no sources and sinks consisting of two disjoint cycles and the paths connecting these cycles. We prove that if an essential graph is shift equivalent to a meteor graph, then it is also a meteor graph. Moreover, two meteor graphs are shift equivalent if and only if they are strongly shift equivalent, if and only if their corresponding Leavitt path algebras are graded Morita equivalent, if and only if their graded K-theories, K0gr, are ℤ[x, x−1]-module isomorphic. As a consequence, the Leavitt path algebras of meteor graphs are graded Morita equivalent if and only if their graph C*-algebras are equivariantly Morita equivalent.
| Original language | English |
|---|---|
| Journal | Israel Journal of Mathematics |
| DOIs | |
| State | E-pub ahead of print - Mar 26 2026 |
Fingerprint
Dive into the research topics of 'Williams’ conjecture holds for meteor graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver