| Autor: |
Zuo, Yang, Tang, Yaqian, Wu, Renfang, Deng, Hanyuan |
| Předmět: |
|
| Zdroj: |
Discrete Mathematics, Algorithms & Applications; Feb2020, Vol. 12 Issue 1, pN.PAG-N.PAG, 14p |
| Abstrakt: |
The Balaban index and the sum-Balaban index of a graph G = (V , E) are defined as J (G) = m μ + 1 ∑ u v ∈ E 1 D G (u) D G (v) and S J (G) = m μ + 1 ∑ u v ∈ E 1 D G (u) + D G (v) , respectively, where D G (u) = ∑ v ∈ V d (u , v) is the distance sum of vertex u in G , m is the number of edges and μ is the cyclomatic number of G. A connected graph G is said to be a cactus if each of its blocks is either a cycle or an edge. In this paper, we determine the maximum values of Balaban index and sum-Balaban index and characterize the corresponding extremal graphs among all cacti with n vertices and k cycles. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
