Complexity of subdivision-vertex and subdivision-edge join graphs

Berberler Z. N.

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES AND CRYPTOGRAPHY, cilt.25, sa.6, ss.1809-1815, 2022 (ESCI)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 25 Sayı: 6
  • Basım Tarihi: 2022
  • Dergi Adı: JOURNAL OF DISCRETE MATHEMATICAL SCIENCES AND CRYPTOGRAPHY
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.1809-1815
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements of the graph. In this paper, the first Zagreb index of a class of composite graphs, namely, subdivision-vertex and subdivision-edge join graphs are investigated in order to evaluate the generalized graph entropies, and explicit formulae for the generalized graph entropy of subdivision-vertex and subdivision-edge join graphs are presented.