























We study a recursively defined two-parameter family of graphs which generalize Fibonacci cubes and Pell graphs and determine their basic structural and enumerative properties. In particular, we show that all of them are induced subgraphs of hypercubes and present their canonical decompositions. Further, we compute their metric invariants and establish some Hamiltonicity properties. We show that the new family inherits many useful properties of Fibonacci cubes and hence could be interesting for potential applications. We also compute the degree distribution, opening thus the way for computing many degree-based topological invariants. Several possible directions of further research are discussed in the concluding section.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。