A set of edges X⊆ E (G) of a graph G is an edge general position set if no three edges from
X lie on a common shortest path in G. The cardinality of a largest edge general position set …

Fibonacci Cubes have been an extremely popular area of research since the 1990s. This
unique compendium features the state of research into Fibonacci Cubes. It expands the …

Abstract Let X⊆{0, 1} n. The daisy cube Q n (X) is introduced as the subgraph of Q n
induced by the union of the intervals I (x, 0 n) over all x∈ X. Daisy cubes are partial cubes …

The Fibonacci cube Γ n is the subgraph of hypercube Q n induced by the binary strings that
contain no two consecutive 1s, and the Lucas cube Λ n is obtained from Γ n by removing …

We introduce alternate Lucas cubes, a new family of graphs designed as an alternative for
the well known Lucas cubes. These interconnection networks are subgraphs of Fibonacci …

A lucasene is a hexagon chain that is similar to a fibonaccene, an L-fence is a poset the
Hasse diagram of which is isomorphic to the directed inner dual graph of the corresponding …

L-si-Fibonaccene 是一个基于Fibonaccene 简单变形得到的六角系统, 在其内对偶图上建立了
一种特殊偏序, 命名为L-栅栏. 根据偏序L-栅栏的所有滤子按照反包含关系形成的滤子格 …

Tribonacci cubes Γ n (3) are induced subgraphs of Q n, obtained by removing all the vertices
that contain more than two consecutive 1's. In the present work, we give some enumerative …

The Fibonacci cube of dimension n, denoted as $\Gamma $ n, is the subgraph of the n-cube
5 Q n induced by vertices with no consecutive 1's. Ashrafi and his co-authors proved the non …

Fibonacci cubes and Lucas cubes have been studied as alternatives for the classical
hypercube topology for interconnection networks. These families of graphs have interesting …