In $d$ Bounded degree deletion problem, we are given an undirected graph $G$ and a positive integer $k$, and the task is to find at most $k$ such vertices whose removal decreases the the maximum vertex degree of the graph to at most $d$. The question is to how to find a polynomial kernel (in $k$ ...

I used classic MDS to get 5d vectors by distance matrix, but I got 2 nonzero eigenvalues and 3 zero eigenvalues. So, vectors had 1 and 2 values as nonzero, and others as zero values. Maybe I do something wrong. May I use other method?