The hyper-Zagreb index of cacti with perfect matchings
Let be a simple connected graph. The hyper-Zagreb index is defined as . A connected graph is a cacti if all blocks of are either edges or cycles. Let be the set of cacti of order with a perfect matching and cycles. In this paper, we determine sharp upper bounds of the hyper-Zagreb index of cacti amo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.022 |