Fibonacci-run graphs. I: Basic properties
From MaRDI portal
Publication:2661218
DOI10.1016/j.dam.2021.02.025OpenAlexW3133874287MaRDI QIDQ2661218
Publication date: 1 April 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05518
Mathematical programming (90Cxx) Theory of error-correcting codes and error-detecting codes (94Bxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (4)
Gray codes for Fibonacci \(q\)-decreasing words ⋮ Fibonacci-run graphs. II: Degree sequences ⋮ Fibonacci and Lucas \(p\)-cubes ⋮ The radius and center of Fibonacci-run graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic properties of Fibonacci cubes and Lucas cubes
- Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
- Generalized Fibonacci cubes
- Isometric embedding in products of complete graphs
- Structure of Fibonacci cubes: a survey
- Boundary enumerator polynomial of hypercubes in Fibonacci cubes
- The degree sequence of Fibonacci and Lucas cubes
- Daisy cubes and distance cube polynomial
- \(q\)-cube enumerator polynomial of Fibonacci cubes
- On median nature and enumerative properties of Fibonacci-like cubes
- On domination-type invariants of Fibonacci cubes and hypercubes
- Some diameter notions of Fibonacci cubes
- On the domination number and the total domination number of Fibonacci cubes
- k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes
This page was built for publication: Fibonacci-run graphs. I: Basic properties
