Extremal chromatic bounds for distance Laplacian eigenvalues

For a connected simple graph $G$ on $n$ vertices with chromatic number $χ$, the distance Laplacian matrix is $\DL( G)=\mathrm{diag}(\mathrm{Tr}_{ G}(v_1),\dots,\mathrm{Tr}_{ G}(v_n)) - D( G)$, where $D( G)$ is the distance matrix and $\mathrm{Tr}_{ G}(v)=\sum_{u\in V( G)} d_{ G}(u,v)$ is the transmission. The eigenvalues of $\DL( G)$ are ordered as $\partial^{L}_1( G)\ge \partial^{L}_2( G)\ge \cdots \ge \partial^{L}_n( G)=0$. Building on the chromatic lower bound $\partial^{L}_1( G)\ge n+\ceil{\frac{n}χ}$ and subsequent developments, we prove a \emph{color-class majorization principle}: if $(\ell_1,\dots,\ell_χ)$ are the color-class sizes in an optimal $χ$-coloring with $\ell_1\ge \cdots\ge \ell_χ$, then the first $\ell_1-1$ distance Laplacian eigenvalues satisfy $\partial^{L}_i( G)\ge n+\ell_1$, for $1\le i\le \ell_1-1$. This gives sharp lower bounds on the number of eigenvalues above the chromatic threshold $b_χ=n+\ceil{n/χ}$, thereby refining the distribution theorems of Aouchiche--Hansen (Filomat, 2017) and Pirzada--Khan (LAA, 2021). We further refine clique/independent-set based multiplicity results by deriving explicit chromatic criteria in terms of neighborhood compression, and we generalize the extremal problem for minimum $\partial^{L}_1$ at fixed chromatic number by characterizing all minimizers. Several numerical examples are included along with pictorial representations.