The number of short cycles in Fibonacci cubes
From MaRDI portal
Publication:2031057
DOI10.1016/j.tcs.2021.04.019zbMath1482.05158OpenAlexW3158385478MaRDI QIDQ2031057
Ömer Eğecioğlu, Zülfükar Saygı, Elif Saygı
Publication date: 8 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.019
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Embedding meshes into twisted-cubes
- Cube polynomial of Fibonacci and Lucas cubes
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
- Reliability analysis of twisted cubes
- Structure of Fibonacci cubes: a survey
- The irregularity polynomials of Fibonacci and Lucas cubes
- The On-Line Encyclopedia of Integer Sequences
- On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
- \(q\)-cube enumerator polynomial of Fibonacci cubes
- On median nature and enumerative properties of Fibonacci-like cubes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- On domination-type invariants of Fibonacci cubes and hypercubes
- The locally twisted cubes
- Augmented cubes
- On the domination number and the total domination number of Fibonacci cubes
This page was built for publication: The number of short cycles in Fibonacci cubes