The study of graphs through their associated matrices have always been immensely advantageous. The most natural generalization of various types of energy, namely the distance energy, Harary energy, etc. was introduced recently using the notion of distance-degree energy which in turn is derived from the distance-degree matrix that imbibes both the degree of the vertices in a graph and the distance between them. In this paper, we obtain several analytic expressions and bounds for the distance-degree energy and distance-degree spectral radius of graphs.