On the extremal connective eccentricity index among trees with maximum degree
The connective eccentricity index (CEI) of a graph $G$ is defined as $\xi^{ce}(G)=\sum_{v \in V(G)}\frac{d_G(v)}{\varepsilon_G(v)}$, where $d_G(v)$ is the degree of $v$ and $\varepsilon_G(v)$ is the eccentricity of $v$. In this paper, we characterize the unique trees with the maximum and minimum CEI...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2021-12-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_25656_ce36f15a7dee2e1ace7fdfcaf03f97ae.pdf |