Block structures of graphs and quantum isomorphism

Abstract: We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic. As a corollary of this result, we obtain that a minimal pair of quantum isomorphic graphs which are not isomorphic consists of 2-connected graphs.