On median nature and enumerative properties of Fibonacci-like cubes
From MaRDI portal
Publication:2568482
Recommendations
Cites work
- scientific article; zbMATH DE number 4049076 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 15874 (Why is no real title available?)
- scientific article; zbMATH DE number 166137 (Why is no real title available?)
- scientific article; zbMATH DE number 3463659 (Why is no real title available?)
- scientific article; zbMATH DE number 1339499 (Why is no real title available?)
- scientific article; zbMATH DE number 1475207 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- Generalized fibonacci cubes are mostly hamiltonian
- Median graphs and Helly hypergraphs
- Observability of the extended Fibonacci cubes
- On the Lucas cubes
- Retracts of hypercubes
- Structural and enumerative properties of the Fibonacci cubes
- The observability of the Fibonacci and the Lucas cubes
- The structure of median graphs
Cited in
(43)- Enumerative properties and cube polynomials of Tribonacci cubes
- Peripheral convex expansions of resonance graphs
- Circular embeddability of isometric words
- Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles
- Proofs of two conjectures on generalized Fibonacci cubes
- Gray codes for Fibonacci \(q\)-decreasing words
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- Cube polynomial of Fibonacci and Lucas cubes
- Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
- The eccentricity sequences of Fibonacci and Lucas cubes
- Netlike partial cubes III. The median cycle property
- Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- The number of short cycles in Fibonacci cubes
- Linear recognition and embedding of Fibonacci cubes
- Fibonacci-run graphs. I: Basic properties
- Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle
- Edge general position sets in Fibonacci and Lucas cubes
- Some enumerative properties of a class of Fibonacci-like cubes
- Pell graphs
- Infinite families of 2-isometric and not 3-isometric binary words
- A negative answer to a problem on generalized Fibonacci cubes
- On Fibonacci-like cubes
- Metallic cubes
- Fibonacci and Lucas \(p\)-cubes
- The degree sequence of Fibonacci and Lucas cubes
- Cube-complements of generalized Fibonacci cubes
- Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs
- Edges in Fibonacci cubes, Lucas cubes and complements
- Embedding height balanced trees and Fibonacci trees in hypercubes
- A characterization of non-isometric binary words
- The self-concatenation of isometric strings is isometric
- The structures of bad words
- All good (bad) words consisting of 5 blocks
- Lucas-run graphs
- \(k\)-Fibonacci cubes: a family of subgraphs of Fibonacci cubes
- Fibonacci \((p,r)\)-cubes which are median graphs
- Fibonacci-like cubes as \(Z\)-transformation graphs
- Maximal hypercubes in Fibonacci and Lucas cubes
- \(\Theta\)-graceful labelings of partial cubes
- Structure of Fibonacci cubes: a survey
- Fast recognition of Fibonacci cubes
This page was built for publication: On median nature and enumerative properties of Fibonacci-like cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568482)