Results 121 to 130 of about 880 (146)
Some of the next articles are maybe not open access.
2006
A Fibonacci string of order \(n\) is a binary string of length \(n\) with no two consecutive ones. A Fibonacci string of order \(n\) which does not have a one in both the first and last position is called a Lucas string of order \(n\). The Fibonacci cube and the Lucas cube are the subgraphs of the hypercube induced by the set of Fibonacci strings and ...
C. WHITEHEAD, ZAGAGLIA, NORMA
openaire +2 more sources
A Fibonacci string of order \(n\) is a binary string of length \(n\) with no two consecutive ones. A Fibonacci string of order \(n\) which does not have a one in both the first and last position is called a Lucas string of order \(n\). The Fibonacci cube and the Lucas cube are the subgraphs of the hypercube induced by the set of Fibonacci strings and ...
C. WHITEHEAD, ZAGAGLIA, NORMA
openaire +2 more sources
Observability of the extended Lucas cubes
2004The \(n\)-dimensional hypercube \(Q_n\) is a graph whose vertex set consists of all binary vectors of length \(n\), two vertices being joined by an edge whenever they differ in exactly one coordinate. The authors define the \(i\)th extended Lucas cube \(\Lambda_n^i\) of order \(n\) \((1\leq ii\geq3\). This extends previous work by \textit{E.
C. WHITEHEAD, ZAGAGLIA, NORMA
openaire +2 more sources
Complexity Analysis of Data Routing Algorithms in Extended Lucas Cube Networks
2010We introduce a class of novel interconnection topologies called extended Lucas cube (ELC). The ELC is an induced subgraph of hypercube defined in terms of Fibonacci strings. This model is classified as a member of the Fibonacci cube family. ELC can serve as a framework for studying degraded hypercube due to faulty nodes or links.
null Ernastuti, Ravi A. Salim
openaire +1 more source
STRONG EDGE COLORING OF FIBONACCI AND LUCAS CUBES
Herald of Russian-Armenian (Slavonic) University humanities and social sciences, 2022A. Drambyan, T. Petrosyan
openaire +1 more source