2 problems

Upper-bound conjecture. Any connected graph $G=(V,E)$ has

Maximum periodicity conjecture. The maximum periodicity of any vertex $v$ in each listed fractal graph is given by the corresponding value above.