It Is Better to Be Semi-Regular When You Have a Low Degree

-regular graph in the case of a non-integer d. We characterize their algebraic connectivity in terms of a root of a certain sixth-degree polynomial. Finally, we construct a small-world-type network of an average degree of 2.5 with relatively high algebraic connectivity. We also propose some related open problems and conjectures.