By L. Cordeiro and others

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 two meteor graphs are shift equivalent if and only if they are strongly shift equivalent, if and only if their corresponding Leavitt path algebras... Show more

April 12, 2023

Loading full text...

Similar articles

Loading recommendations...

x1

Williams' Conjecture holds for meteor graphs

Click on play to start listening