Indexed metadata

Cut Decomposition and Induced-Edge Statistics for Degree-Based Edge Indices Under Thorn Reassignments on Regular Cores

Xing-Yu Hu

Source record

Source: Crossref

Published: Aug 21, 2026

DOI: 10.20944/preprints202608.1503.v1

Open original source ↗

Source abstract

Let GG be an rr-regular graph of order n, r ≥ 1, and form G(m)G^{(\mathbf{m})} by attaching mvm_v pendants to each core vertex vv. For a symmetric degree-based weight φ\varphi, define Iφ(H)=∑uv∈E(H)φ(dH(u),dH(v)). I_\varphi(H) = \sum_{uv \in E(H)} \varphi\bigl(d_H(u), d_H(v)\bigr). Fix the thorn multiset {mv:v∈V(G)}\{m_v : v \in V(G)\}, but allow its values to be reassigned among core vertices. A multilevel cut decomposition isolates placement dependence. The cut between the core classes of degrees aa and bb has coefficient −12 Δφ(a,b),where Δφ(a,b)=φ(a,a)−2φ(a,b)+φ(b,b). -\tfrac12 \, \Delta\varphi(a,b), \quad \text{where } \Delta\varphi(a,b) = \varphi(a,a) - 2\varphi(a,b) + \varphi(b,b). For a fixed core and a finite nonempty set AA of attainable degrees, every thorn multiset whose core-vertex degrees lie in AA is reassignment-invariant if and only if GG is complete or the restricted weight matrix is a symmetric sum matrix. If invariance is required for every connected rr-regular core, where r ≥ 2, only the sum-matrix case remains. With two thorn levels, IφI_\varphi is affine in the induced-edge count eG(S)e_G(S) of the kk vertices receiving the larger number. This relation determines the value set and exact range and gives a criterion for fixed-cardinality invariance. When the coefficient is nonzero, the extremal-placement problem is NP-hard on cubic cores. For fixed kk, the mean and variance of the induced-edge count depend on the core only through its order and regular degree. For 3≤k≤n−33 \le k \le n-3, the third factorial moment determines the triangle count, and the index distribution does so as well whenever the affine coefficient is nonzero. For cycles and equal-part complete multipartite cores, the ranges have closed forms. The ordinary, reduced, and Euler Sombor indices are maximized when the heavy-vertex set induces as few core edges as possible, whereas the elliptic Sombor index is maximized when it induces as many as possible. The forgotten index is placement-invariant.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.