Enumeration of spanning trees in a chain of diphenylene graphs

Modabish A., Husin M. N., Alameri A. Q., Ahmed H., Alaeiyan M., Farahani M. R., ...Daha Fazla

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, cilt.25, sa.1, ss.241-251, 2022 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 25 Sayı: 1
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1080/09720529.2022.2038931
  • Dergi Adı: JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & 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.241-251
  • Anahtar Kelimeler: Spanning trees, Laplacian matrix, Diphenylene, Chain of diphenylene, HYPER-ZAGREB INDEX, TOPOLOGICAL INDEXES
  • Van Yüzüncü Yıl Üniversitesi Adresli: Evet

Özet

Cheminformatics is a modern field of chemistry information science and mathematics that is very much helpful in keeping the data and getting information about chemicals. A new two-dimensional carbon known as diphenylene was identified and synthesized. It is considered one of the materials that have many applications in most fields such as catalysis. The number of spanning trees of a graph G, also known as the complexity of a graph G, denoted by tau(G), is an important, well-studied quantity in graph theory, and appears in a number of applications. In this paper, we introduce a new chemical compound that is a chain of diphenylene where any two diphenylene intersect by one edge. We derive two formulas for the number of spanning trees in a chain of diphenylene planar graphs that have connected intersection of one edge but where the diphenylenes have same sizes.