1 problem

Let $\mathcal{G}(n)$ be a symmetric connected graph. Denote by $\mathcal{A}(\mathcal{G}(n))$ the set of strictly diagonally dominant weight matrices for $\mathcal{G}(n)$, and by…