A lower bound for the exponential Randić index of line graphs of trees
Ars Combinatoria · 12.05.2026 · 167 · 45-56
DOI: 10.61091/ars167-03 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 12.05.2026. Verfasst von Xinwen Cui und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The exponential Randić index of a graph \(G\), denoted by \(ER(G)\), is defined as \(\sum\limits_{uv\in E(G)}e^{\frac{1}{d(u)d(v)}}\), where \(d(u)\) denotes the degree of a vertex \(u\) in \(G\). The line graph \(L(G)\) of a graph \(G\) is a graph in which each vertex represents an edge of \(G\), and two vertices are adjacent in \(L(G)\) if and only if their corresponding edges in \(G\) are incident to a common vertex. In this paper, we proved that for any tree \(T\) of order \(n\ge3\), \(ER(L(T))>\frac{n}{4}e^{\frac{1}{2}}\).
Zitieren
APA
Cui, X., & Zhu, Y. (2026). A lower bound for the exponential Randić index of line graphs of trees. Ars Combinatoria, 167, 45-56. https://doi.org/10.61091/ars167-03
Vancouver
Cui X, Zhu Y. A lower bound for the exponential Randić index of line graphs of trees. Ars Combinatoria. 2026;167:45-56. doi:10.61091/ars167-03
BibTeX
@article{Cui2026,
author = {Cui, Xinwen and Zhu, Yan},
title = {A lower bound for the exponential Randić index of line graphs of trees},
journal = {Ars Combinatoria},
year = {2026},
volume = {167},
pages = {45--56},
doi = {10.61091/ars167-03}
}
EUVIMED