Results 111 to 120 of about 491 (139)
Some of the next articles are maybe not open access.

The Irregularity Polynomials of Fibonacci and Lucas cubes

Bulletin of the Malaysian Mathematical Sciences Society, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ömer Eğecioğlu   +2 more
openaire   +2 more sources

Fibonacci and Lucas p-cubes

Discrete Applied Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianxin Wei, Yujun Yang
openaire   +2 more sources

Cube-Complements of Fibonacci and Lucas Cubes

Journal of Interconnection Networks
The Fibonacci cube [Formula: see text] can be obtained from the hypercube [Formula: see text] by removing all vertices that contain [Formula: see text] as a substring, and the Lucas cube [Formula: see text] can be obtained from [Formula: see text] by removing all the vertices that have a circulation containing [Formula: see text].
Jianxin Wei, Yujun Yang
openaire   +1 more source

Data Routing Algorithms in Extended Lucas Cube Networks

2008 IEEE International Conference on Signal Image Technology and Internet Based Systems, 2008
We 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. The hypercube is a powerful network that is able to perform various kinds of parallel computation and simulate many other networks.
null Ernastuti, Ravi A. Salim, A. Juarna
openaire   +1 more source

Extended Lucas cubes

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

Observability of the extended Lucas cubes

2004
The \(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

2010
We 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

On the Lucas Cubes

The Fibonacci Quarterly, 2001
MUNARINI, EMANUELE   +2 more
openaire   +2 more sources

Nitrogen reduction by the Fe sites of synthetic [Mo3S4Fe] cubes

Nature, 2022
Yasuhiro Ohki   +2 more
exaly  

Home - About - Disclaimer - Privacy