Zeroth-order general Randić index of cactus graphs
A connected graph is said to be cactus if no two cycles of have any common edge. The present note is devoted to developing some extremal results for the zeroth-order general Randić index of cactus graphs and finding some sharp bounds on this index.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.006 |