作者: Victor Chepoi , Sandi Klavẑar
DOI: 10.1016/S0012-365X(98)00064-8
关键词:
摘要: Abstract In this note we present some new results on distances in benzenoids. An algorithm is presented which, for a given benzenoid system G bounded by simple circuit Z with n vertices, computes the Wiener index of O( ) time. Also show that systems have convenient dismantling scheme, which can be derived applying breadth-first search to their dual graphs. Our last result deals clustering problem sets atoms benzenoids systems. We how k -means (for points Euclidean space) efficiently implemented case