Results 1 to 10 of about 906 (135)
In this paper, we introduce a novel class of graphs referred to as the Horadam–Lucas cubes. This class extends the concept of Lucas cubes and retains numerous desirable properties associated with them.
Vesna Irsic, Elif Tan, Luka Podrug
exaly +6 more sources
The Mostar and Wiener index of Alternate Lucas Cubes [PDF]
The Wiener index and the Mostar index quantify two distance related properties of connected graphs: the Wiener index is the sum of the distances over all pairs of vertices and the Mostar index is a measure of how far the graph is from being distance ...
Omer Eğecioğlu +2 more
doaj +5 more sources
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes [PDF]
Graph ...
Jernej Azarija +3 more
doaj +5 more sources
The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes [PDF]
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. Denote by Γ[un,k,z] the subgraph of Γn induced by the end-vertex un,k,z that has no up-neighbor.
Shengzhang Ren
doaj +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
exaly +2 more sources
Cube Polynomial of Fibonacci and Lucas Cubes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar +2 more
exaly +3 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 ...
Michel Mollard
exaly +4 more sources
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring.
Azam Ghaleh Agha Babai,
doaj +7 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 ...
Sandi Klavžar +2 more
exaly +4 more sources
Edge General Position Sets in Fibonacci and Lucas Cubes
AbstractA set of edges$$X\subseteq E(G)$$X⊆E(G)of a graphGis an edge general position set if no three edges fromXlie on a common shortest path inG. The cardinality of a largest edge general position set ofGis the edge general position number ofG. In this paper, edge general position sets are investigated in partial cubes.
Sandi Klavžar, Klavžar Sandi
exaly +8 more sources

