Williams’ conjecture holds for meteor graphs
摘要
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, K