k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes

Egecioglu O., Saygı E., Saygi Z.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, cilt.31, sa.5, ss.639-661, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 31 Sayı: 5
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1142/s0129054120500318
  • Dergi Adı: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Computer & Applied Sciences, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.639-661
  • Anahtar Kelimeler: Hypercube, Fibonacci cube, Fibonacci number, ENUMERATIVE PROPERTIES, DISJOINT HYPERCUBES, LUCAS
  • Hacettepe Üniversitesi Adresli: Evet

Özet

Hypercubes and Fibonacci cubes are classical models for interconnection networks with interesting graph theoretic properties. We consider k-Fibonacci cubes, which we obtain as subgraphs of Fibonacci cubes by eliminating certain edges during the fundamental recursion phase of their construction. These graphs have the same number of vertices as Fibonacci cubes, but their edge sets are determined by a parameter k. We obtain properties of k-Fibonacci cubes including the number of edges, the average degree of a vertex, the degree sequence and the number of hypercubes they contain.