Let \(G\) be an \(r\)-regular graph of order \(n\), \(r \ge 1\), and form \(G^{(\mathbf{m})}\) by attaching \(m_v\) pendants to each core vertex \(v\). For a symmetric degree-based weight \(\varphi\), define \[ I_\varphi(H) = \sum_{uv \in E(H)} \varphi(d_H(u), d_H(v)). \] For reassignments of a fixed thorn multiset among core vertices, a multilevel decomposition expresses all placement dependence as a weighted sum of cuts between core-degree classes. The cut between classes \(a\) and \(b\) has coefficient \(-\tfrac12 \Delta\varphi(a,b)\), where \(\Delta\varphi(a,b) = \varphi(a,a) - 2\varphi(a,b) + \varphi(b,b)\). For a fixed core and a finite nonempty set \(A\) of attainable degrees, every thorn multiset whose core-vertex degrees lie in \(A\) is reassignment-invariant if and only if \(G\) is complete or the restriction of \(\varphi\) to \(A \times A\) is a symmetric sum matrix. Requiring invariance for every connected \(r\)-regular core with \(r \ge 2\) leaves only the sum-matrix case. With two thorn levels, \(I_\varphi\) is affine in the induced-edge count \(e_G(S)\) of the \(k\) vertices receiving the larger thorn number. This determines the complete value set, exact range, and fixed-cardinality invariance criterion. On cubic cores, minimizing the index is NP-hard when the affine coefficient is positive, and maximizing it is NP-hard when the coefficient is negative. For fixed \(k\), the mean and variance of \(e_G(S)\) under uniform \(k\)-set sampling depend only on \(n\) and \(r\). For \(3 \le k \le n-3\), the third factorial moment determines the triangle count, as does the index distribution when the affine coefficient is nonzero. Cycles and equal-part complete multipartite cores admit exact ranges, with consequences for Sombor-type indices. The results connect degree-based edge indices with quadratic assignment, fixed-cardinality induced-subgraph optimization, and random induced-subgraph statistics.