Entropies of Composite Graphs

BERBERLER Z. N., BERBERLER M. E.

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, cilt.42, ss.2301-2308, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 42
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1007/s40995-018-0574-0
  • Dergi Adı: IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2301-2308
  • Anahtar Kelimeler: Signless Laplacian matrix, Zagreb index, Generalized graph entropy, R-corona, R-join, NETWORKS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy function is used. In this paper, we investigate and present explicit formulae for the complexity of classes of composite graphs based on R-graphs by evaluating the generalized graph entropies. In addition, a polynomial time algorithm is designed for computing the generalized entropy of graphs.