In previous works we considered a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco and showed that extending this Hopf Algebra by identifying pairs of nearest neighbour leaves and thus producing graphs with loops we obtain the full recursion formula of Eynard and Orantin. We also discussed the algebraic structure of the spaces of correlation functions in $g=0$ and in $g\gt 0$. By taking a classical and a quantum product respectively we endowed both spaces with a ring structure. Here we will show that the extended algebra of graphs is in fact a Hopf algebra and can be seen as a sort of quantization of the Loday-Ronco Hopf algebra. This is work in progress.