Cyclic Sources of Strong Domination in Graph Norms

Conlon and Lee asked for strongly dominating graphs beyond norming graphs and even paths. We construct a two-parameter family of pairwise non-isomorphic $2$-connected strongly dominating graphs that are not seminorming, and hence lie outside the two classes of examples previously identified for signed strong domination. The construction uses cyclic amalgamation of two-rooted blocks. For root-reversible blocks, we characterize the generation of all even cyclic amalgams by local even-Schatten inequalities for transfer operators. We determine this criterion for $K_{2,m}$, with the roots in the part of size $m$: it holds exactly when $m$ is even. We also classify the connected outerplanar strongly dominating graphs and the connected root-reversible outerplanar blocks satisfying the universal cyclic criterion.