The number of short cycles in Fibonacci cubes

Egecioglu O., SAYGI E., SAYGI Z.

THEORETICAL COMPUTER SCIENCE, cilt.871, ss.134-146, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 871
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1016/j.tcs.2021.04.019
  • Dergi Adı: THEORETICAL COMPUTER SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Computer & Applied Sciences, INSPEC, MathSciNet, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.134-146
  • Hacettepe Üniversitesi Adresli: Evet

Özet

The Fibonacci cube is the subgraph of the hypercube induced by the vertices whose binary string representations do not contain two consecutive 1s. These cubes were presented as an alternative interconnection network. In this paper, we calculate the number of induced paths and cycles of small length in Fibonacci cubes by using the recursive structure of these graphs. (C) 2021 Elsevier B.V. All rights reserved.