Results 1 to 10 of about 180 (135)
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Jernej Azarija +3 more
doaj +5 more sources
Cube Polynomial of Fibonacci and Lucas Cubes [PDF]
Acta Applicandae Mathematicae, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar +2 more
exaly +3 more sources
Prefixes of the Fibonacci word that end with a cube
Comptes Rendus. Mathématique, 2023 The Fibonacci word $\mathbf{f} = 010010100100101\cdots $ is one of the most well-studied words in the area of combinatorics on words. It is not periodic, but nevertheless contains many highly periodic factors (contiguous subwords).
Rampersad, Narad
doaj +4 more sources
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar +2 more
exaly +2 more sources
The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes [PDF]
Journal of Applied Mathematics, 2014 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 disjoint hypercubes in Fibonacci cubes
Discrete Applied Mathematics, 2015 The {\em Fibonacci cube} of dimension $n$, denoted as $Γ\_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $Γ\_n$ isomorphic to $Q\_k$, and denote this number by $q\_k(n)$.
Sylvain Gravier +2 more
exaly +4 more sources
On the Wiener index of generalized Fibonacci cubes and Lucas cubes
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, Yoomi Rho
exaly +2 more sources
The degree sequence of Fibonacci and Lucas cubes
Discrete Mathematics, 2011 The Fibonacci cube $\Gamma_n$ is the subgraph of the $n$-cube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $\Lambda_n$ is obtained from $\Gamma_n$ by removing vertices that start and end with 1. It is proved that the number of vertices of degree $k$ in $\Gamma_n$ and $\Lambda_n$ is $\sum_{i = 0}^k \binom{n-2i}{k-i} \
Sandi Klavžar +2 more
exaly +4 more sources
Maximal hypercubes in Fibonacci and Lucas cubes
Discrete Applied Mathematics, 2012 The Fibonacci cube $Γ_n$ is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $Λ_n$ is obtained from $Γ_n$ by removing vertices that start and end with 1. We characterize maximal induced hypercubes in $Γ_n$ and $Λ_n$ and deduce for any $p\leq n$ the number of maximal $p$-dimensional ...
Michel Mollard
exaly +3 more sources
The Mostar and Wiener index of Alternate Lucas Cubes [PDF]
Transactions on Combinatorics, 2023 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 +1 more source