Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs
From MaRDI portal
Publication:2275392
DOI10.1016/j.disc.2011.04.002zbMath1223.05236OpenAlexW1533387826MaRDI QIDQ2275392
Haiyuan Yao, Heping Zhang, Lifeng Ou
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.002
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- Fibonacci-like cubes as \(Z\)-transformation graphs
- On generalized Fibonacci cubes and unitary transforms
- Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- \(Z\)-transformation graphs of maximum matchings of plane bipartite graphs
- \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs
- Plane elementary bipartite graphs
- Resonance graphs of catacondensed even ring systems are median
- Z-transformation graphs of perfect matchings of hexagonal systems
- Structural and enumerative properties of the Fibonacci cubes
- Parallel tree contraction and prefix computations on a large family of interconnection topologies
- On median nature and enumerative properties of Fibonacci-like cubes
- Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
- The postal network: A recursive network for parameterized communication model
This page was built for publication: Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs
