Among the classical models for interconnection networks are hypercubes and Fibonacci
cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the …

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 …

The irregularity of a graph G is the sum of| deg (u)-deg (v)|| deg (u)-deg (v)| over all edges uv
of G. In this paper, this invariant is considered on π π-permutation graphs, Fibonacci cubes …

The Fibonacci cube is the subgraph of the hypercube induced by the vertices whose binary
string representations do not contain two consecutive 1s. These cubes were presented as …

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 …

Let k be a positive integer and G be a simple connected graph. The eccentric distance sum
of G is defined as ξ d (G)=∑ v∈ V (G) 𝜀 G (v) DG (v), where 𝜀 G (v) is the maximum distance …

© 2023 Society of Mathematicians, Physicists and Astronomers of Slovenia. All rights
reserved. Pell graphs are defined on certain ternary strings as special subgraphs of …

Fibonacci cubes are defined as subgraphs of hypercubes, where the vertices are those
without two consecutive 1's in their binary string representation. $ k $-Fibonacci cubes are in …

In this paper we prove that the dominator chromatic number of every oriented tree is
invariant under reversal of orientation. In addition to this marquee result, we also prove the …

Lucas cubes are special subgraphs of Fibonacci cubes. For small dimensions, their
domination numbers are obtained by direct search or integer linear programming. For larger …