[1] A. A. Dobrynin and A. A. Kochetova, Degree distance of a graph: a degree analog of the Wiener index, J. Chem. Inf. Comput. Sci. 34 (1994) 1082–1086, https://doi.org/10.1021/ci00021a008.
[2] I. Tomescu, Ordering connected graphs having small degree distances, Discrete Appl. Math. 158 (2010) 1714–1717,
https://doi.org/10.1016/j.dam.2010.05.023.
[3] I. Tomescu and S. Kanwal, Ordering connected graphs having small degree distances. II, MATCH Commun. Math. Comput. Chem. 67 (2012) 425–437.
[4] I. Tomescu and S. Kanwal, Unicyclic connected graphs having smallest degree distances, Util. Math. 97 (2015) 161–181.
[5] M. Dragan and I. Tomescu, Bicyclic connected graphs having smallest degree distances, In 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) IEEE (2019) 105–108, https://doi.org/10.1109/SYNASC49474.2019.00023.
[6] W. Zhu, S. Hu and H. Ma, A note on tricyclic graphs with minimum degree distance, Discrete Math. Algorithms Appl. 3 (2011) 25–32, https://doi.org/10.1142/S1793830911000985.