Describir: Graph coverings in the degree-diameter problem and in the degree-girth problem