Maximal distance spectral radius of 4-chromatic planar graphs

Abstract

We show that the kite graph $K_4^{(n)}$ uniquely maximizes the distance spectral radius among all connected $4$-chromatic planar graphs on $n$ vertices.