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 cubes and have a useful fundamental decomposition similar to the one for Fibonacci cubes.
Ömer Eğecioğlu +2 more
openaire +3 more sources
Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes
The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter is called diametrically opposite vertices. The collection of shortest paths between diametrically opposite vertices is referred as diametral paths.
Ömer Eğeci̇oğlu +2 more
openaire +4 more sources
The Mostar Index of Fibonacci and Lucas Cubes [PDF]
The Mostar index of a graph was defined by Došlić, Martinjak, Škrekovski, Tipurić Spužević and Zubac in the context of the study of the properties of chemical graphs. It measures how far a given graph is from being distance-balanced. In this paper, we determine the Mostar index of two well-known families of graphs: Fibonacci cubes and Lucas cubes.
Ömer Eğecioğlu +2 more
openaire +5 more sources
Cube Polynomial of Fibonacci and Lucas Cubes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klavžar, Sandi, Mollard, Michel
openaire +2 more sources
Asymptotic Properties of Fibonacci Cubes and Lucas Cubes [PDF]
It is proved that the asymptotic average eccentricity and the asymptotic average degree of Fibonacci cubes and Lucas cubes are $(5+\sqrt 5)/10$ and $(5-\sqrt 5)/5$, respectively. A new labeling of the leaves of Fibonacci trees is introduced and proved that the eccentricity of a vertex of a given Fibonacci cube is equal to the depth of the associated ...
Klavžar, Sandi, Mollard, Michel
openaire +3 more sources
The structure of $k$-Lucas cubes
Fibonacci cubes and Lucas cubes have been studied as alternatives for the classical hypercube topology for interconnection networks. These families of graphs have interesting graph theoretic and enumerative properties. Among the many generalization of Fibonacci cubes are $k$-Fibonacci cubes, which have the same number of vertices as Fibonacci cubes ...
Ömer EĞECİOĞLU +2 more
openaire +6 more sources
Exploring the links between Large Igneous Provinces and dramatic environmental impact
An emerging consensus suggests that Large Igneous Provinces (LIPs) and Silicic LIPs (SLIPs) are a significant driver of dramatic global environmental and biological changes, including mass extinctions.
Jessica H. Whiteside +3 more
wiley +2 more sources
Edges in Fibonacci Cubes, Lucas Cubes and Complements [PDF]
The Fibonacci cube of dimension n, denoted as $Γ\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper based on the recursive structure of $Γ\_n$ it is proved that the irregularity of $Γ\_n$ and $Λ\_n$ are two times the ...
openaire +3 more sources
On the Cube Polynomials of Padovan and Lucas–Padovan Cubes
The hypercube is one of the best models for the network topology of a distributed system. Recently, Padovan cubes and Lucas–Padovan cubes have been introduced as new interconnection topologies. Despite their asymmetric and relatively sparse interconnections, the Padovan and Lucas–Padovan cubes are shown to possess attractive recurrent structures.
Gwangyeon Lee, Jinsoo Kim
openaire +1 more source
Structure and enumeration results of matchable Lucas cubes [PDF]
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 lucasene. A new class of cubes, which named after matchable Lucas cubes according to the number of its vertices (or elements), are a series of directed or undirected Hasse
Wang, Xu, Zhao, Xuxu, Yao, Haiyuan
openaire +3 more sources

