Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees

Source abstract

For a tree T, let gamma(T) be its domination number and let mu(T) count the Laplacian eigenvalues in [0,1). The strict inequality gamma(T)/mu(T) =2, max_{|V(T)|=n} (7 gamma(T)-9 mu(T)) = floor((n-20)/9). Thus order twenty-nine is the first at which the ratio 9/7 can be exceeded. The proof is based on an exact decomposition of Phi(T)=|V(T)|-20-9(7 gamma(T)-9 mu(T)) into nonnegative integer terms, together with a clean-contraction identity. For subcubic trees, equality cases are canonical lifts of trees with perfect matchings. We classify every layer through Phi=42, locating successive phase transitions at 20, 21, 40, 41, and 42. The finiteness mechanism is simple to state: after the repeatable matched-skeleton pieces are removed, fixed slack leaves only a bounded exceptional core. Formally, a local compactness theorem bounds every nonordinary weighted deep component at fixed packing surplus and residual negative index. Consequently, for each fixed k, every subcubic tree with Phi(T)=k consists of a bounded ported defect kernel, an arbitrary compatible forest of ordinary tiles, and at most floor(k/21) clean expansions. All unbounded statements are proved symbolically; exact computation is used only for explicitly bounded atom lists and independent finite verification.