Generalized Discrete Fractal Dimensions of Graph Families

Quantifying the self-similarity of complex networks via discrete fractal dimensions is a fundamental problem in network science. In this paper, we investigate some general fractal dimensions of graph families based on q-energy and Rényi entropy. We first establish several bounds for the energy, and then discuss the monotonicity, measure invariance of the dimensions, as well as some concrete graph families.