Lehtonen, ErkkoWaldhauser, Tamás2022-01-272022-01-272021-050925-9899PURE: 36397099PURE UUID: bb0ee441-7401-4f27-b574-82cde9e75a82Scopus: 85105377703WOS: 000646097800001http://hdl.handle.net/10362/131652K115518 TUDFO/47138-1/2019-ITMAssociative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities: constant 1, powers of 2, and Catalan numbers. Associative and antiassociative digraphs are described, and associative spectra are determined for certain families of digraphs, such as paths, cycles, and graphs on two vertices.26762134engAssociative spectrumCatalan numberDFS treeGraph algebraAlgebra and Number TheoryDiscrete Mathematics and CombinatoricsAssociative spectra of graph algebras Ijournal article10.1007/s10801-020-01010-wFoundations, undirected graphs, antiassociative graphshttps://www.scopus.com/pages/publications/85105377703