Results 1 to 10 of about 173 (142)
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
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
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 +1 more source
Linear recognition of generalized Fibonacci cubes $Q_h(111)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The generalized Fibonacci cube $Q_h(f)$ is the graph obtained from the $h$-cube $Q_h$ by removing all vertices that contain a given binary string $f$ as a substring.
Yoomi Rho, Aleksander Vesel
doaj +1 more source
Cube Polynomial of Fibonacci and Lucas Cubes [PDF]
Acta Applicandae Mathematicae, 2011 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]
Annals of Combinatorics, 2014 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
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes
International Journal of Foundations of Computer Science, 2020 Hypercubes and Fibonacci cubes are classical models for interconnection networks with interesting graph theoretic properties. We consider [Formula: see text]-Fibonacci cubes, which we obtain as subgraphs of Fibonacci cubes by eliminating certain edges during the fundamental recursion phase of their construction.
Egecioglu, Omer +2 more
openaire +2 more sources
Edges in Fibonacci Cubes, Lucas Cubes and Complements [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2021 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
Extended Fibonacci Cubes [PDF]
IEEE Transactions on Parallel and Distributed Systems, 1997 The Fibonacci cube (FC) is an interconnection network that possesses many desirable properties that are important in network design and application. However, most Fibonacci cubes (more than two third of all) are not Hamiltonian. In this paper, we propose a new network topology called extended Fibonacci cube (EFC/sub 1/) based on the same sequence F(i ...
openaire +1 more source
ALGORITMA PARALEL ODD EVEN TRANSPOSITION PADA MODEL JARINGAN NON-LINIER
Jurnal Ilmu Komputer dan Informasi, 2012 Odd-even-transposition adalah suatu algoritma paralel yang merupakan pengembangan dari algoritma sekuensial “bubble sortâ€. Algoritma odd-even-transposition ini didesain khusus untuk model jaringan array linier (homogen).
Ernastuti ., Ravi A. Salim, Haryanto .
doaj +1 more source