On Euler Sombor Index of Tricyclic Graphs

---

Kizilirmak G. O.

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, cilt.94, sa.1, 2025 (SCI-Expanded, Scopus)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 94 Sayı: 1
• Basım Tarihi: 2025
• Doi Numarası: 10.46793/match.94-1.247k
• Dergi Adı: MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
• Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, MathSciNet, zbMATH
• Gazi Üniversitesi Adresli: Evet

Özet

Let G be a simple graph. The Euler Sombor index of G is defined X EU(G) = xy is an element of E(G) qd2G(x) + d2G(y) + (dG(x)dG(y)), where dG(x) denotes the degree of the vertex x, and the sum runs over the set of edges of G. In this paper we determine the extremal values of Euler Sombor index of tricyclic graphs.