Generalized Fibonacci cubes

DOI10.1016/j.disc.2011.02.015zbMath1233.05165OpenAlexW2037148158MaRDI QIDQ658012

Aleksandar Ilić, Yoomi Rho, Sandi Klavžar

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.015

zbMATH Keywords

embeddable infinite seriesmedian closed subgraphsnon-embeddable infinite series

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (39)

A negative answer to a problem on generalized Fibonacci cubes ⋮ Quaternary \(n\)-cubes and isometric words ⋮ Domination type parameters of Pell graphs ⋮ The structures of bad words ⋮ The self-concatenation of isometric strings is isometric ⋮ All good (bad) words consisting of 5 blocks ⋮ Fibonacci-run graphs. I: Basic properties ⋮ Infinite families of 2-isometric and not 3-isometric binary words ⋮ The (non-)existence of perfect codes in Lucas cubes ⋮ Enumerative properties and cube polynomials of Tribonacci cubes ⋮ On the chromatic polynomial and the domination number of k-Fibonacci cubes ⋮ Checking whether a word is Hamming-isometric in linear time ⋮ A characterization of non-isometric binary words ⋮ Alternate Lucas Cubes ⋮ Hypercubes and isometric words based on swap and mismatch distance ⋮ Structure of the space of taboo-free sequences ⋮ Structure of Fibonacci cubes: a survey ⋮ Fibonacci \((p,r)\)-cubes as Cartesian products ⋮ Proof of a conjecture on 2-isometric words ⋮ Asymptotic number of isometric generalized Fibonacci cubes ⋮ Cube-complements of generalized Fibonacci cubes ⋮ Solution to a conjecture on words that are bad and 2-isometric ⋮ Cube polynomial of Fibonacci and Lucas cubes ⋮ On isomorphism classes of generalized Fibonacci cubes ⋮ Proofs of two conjectures on generalized Fibonacci cubes ⋮ Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles ⋮ The structure of $k$-Lucas cubes ⋮ The index of a binary word ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ The existence of perfect codes in a family of generalized Fibonacci cubes ⋮ Daisy cubes and distance cube polynomial ⋮ Pell graphs ⋮ Fibonacci and Lucas \(p\)-cubes ⋮ Circular embeddability of isometric words ⋮ On \(k\)-ary \(n\)-cubes and isometric words ⋮ Equal opportunity networks, distance-balanced graphs, and Wiener game ⋮ k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes ⋮ Efficient proper embedding of a daisy cube ⋮ On the Wiener index of generalized Fibonacci cubes and Lucas cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• Some Turán type results on the hypercube
• On the lattice of order ideals of an up-down poset
• The structure of median graphs
• The lattice dimension of a graph
• The observability of the Fibonacci and the Lucas cubes
• Structural and enumerative properties of the Fibonacci cubes
• Fast recognition of Fibonacci cubes
• \(\Theta\)-graceful labelings of partial cubes
• Recursive fault-tolerance of Fibonacci cube in hypercubes
• On median nature and enumerative properties of Fibonacci-like cubes
• Generalized fibonacci cubes are mostly hamiltonian

This page was built for publication: Generalized Fibonacci cubes