Extremum sum-connectivity index of trees and unicyclic graphs

Shooshtari H., Motamedi R., Cancan M.

ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, cilt.15, sa.11, 2022 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 15 Sayı: 11
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1142/s1793557122501972
  • Dergi Adı: ASIAN-EUROPEAN JOURNAL OF MATHEMATICS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, zbMATH
  • Anahtar Kelimeler: Sum-connectivity index, tree, unicyclic graphs
  • Van Yüzüncü Yıl Üniversitesi Adresli: Evet

Özet

The sum-connectivity index of a graph G is defined as the sum of weights 1/root d(w) +d(z ) over all edges wz of G, where d(w) and d(z) are the degrees of the vertices w and z in G, respectively. In this paper, we provide a simpler method to the extremal trees and unicyclic graph of the sum-connectivity index.