R. S. Haoer, K.A Atan, M. R. Md. Said, A. M. Khalaf, R. Hasni
الملخص العربي
Let G be a molecular graph. The distance between two vertices of G is the length of a shortest path connecting these two vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex in G. In this paper, we consider some infinite families of molecular graphs with application to cycloalkanes and compute their some
eccentricity based Zagreb indices.
تاريخ النشر
01/11/2016
الناشر
Journal of Computational and Theoretical Nanoscience
عبد الجليل منشد خلف | Abdul Jalil M. Khalaf | 3165