این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Mathematical Chemistry، جلد ۱۲، شماره ۱، صفحات ۱-۱۸
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Computing the Mostar Index in Networks with Applications to Molecular Graphs
چکیده انگلیسی مقاله Recently, a bond-additive topological descriptor, named as the Mostar index, has been introduced as a measure of peripherality in networks. For a connected graph $G$, the Mostar index is defined as $Mo(G) = sum_{e=uv in E(G)} |n_u(e) - n_v(e)|$, where for an edge $e=uv$ we denote by $n_u(e)$ the number of vertices of $G$ that are closer to $u$ than to $v$ and by $n_v(e)$ the number of vertices of $G$ that are closer to $v$ than to $u$. In the present paper, we prove that the Mostar index of a weighted graph can be computed in terms of Mostar indices of weighted quotient graphs. Inspired by this result, several generalizations to other versions of the Mostar index already appeared in the literature. Furthermore, we apply the obtained method to benzenoid systems, tree-like polyphenyl systems, and to a fullerene patch. Closed-form formulas for two families of these molecular graphs are also deduced.
کلیدواژه‌های انگلیسی مقاله Mostar index, cut method, Weighted graph, tree-like polyphenyl system, benzenoid system
نویسندگان مقاله Niko Tratnik |
University of Maribor, Faculty of Natural Sciences and Mathematics

نشانی اینترنتی https://ijmc.kashanu.ac.ir/article_111292_97ff81ab88f1726ca8516ec53cdfe05e.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات