Certain types of minimum covering Estrada index of graphs

Shooshtari H., Atapour M., Cancan M.

ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, cilt.16, sa.05, 2023 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 16 Sayı: 05
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1142/s1793557123500821
  • Dergi Adı: ASIAN-EUROPEAN JOURNAL OF MATHEMATICS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, zbMATH
  • Anahtar Kelimeler: Eigenvalue of graphs, minimum covering, distance Estrada index, Randic Estrada index, Harary Estrada index, Seidel Estrada index, color Estrada index
  • Van Yüzüncü Yıl Üniversitesi Adresli: Evet

Özet

Let G be a simple, finite, undirected graph with n vertices. The main purpose of this paper introduces the concepts of the minimum covering Gutman Estrada index, the minimum covering Seidel Estrada index, the minimum covering distance Estrada index, the minimum covering Randic Estrada index, the minimum covering Harary Estrada index, and the minimum covering color Estrada index of a graph. First, we compute the new concepts for some of the graphs, such as cocktail party, star, crown, complete and complete bipartite. Moreover, we establish upper and lower bounds for the new concepts.