Cacti with extremal PI Index
Publish place: Transactions on Combinatorics، Vol: 5، Issue: 4
Publish Year: 1395
Type: Journal paper
Language: English
View: 221
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_COMB-5-4_001
Index date: 20 November 2021
Cacti with extremal PI Index abstract
The vertex PI index PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)] is a distance-based molecular structure descriptor, where n_{xy}(x) denotes the number of vertices which are closer to the vertex x than to the vertex y and which has been the considerable research in computational chemistry dating back to Harold Wiener in 1947. A connected graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we completely determine the extremal graphs with the greatest and smallest vertex PI indices mong all cacti with a fixed number of vertices. As a consequence, we obtain the sharp bounds with corresponding extremal cacti and extend a known result.
Cacti with extremal PI Index Keywords:
Cacti with extremal PI Index authors
Chunxiang Wang
Central China Normal University
Shaohui Wang
University of Mississippi
Bing Wei
University of Mississippi
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :