Results 121 to 130 of about 515 (134)
Structure and enumeration results of matchable Lucas cubes [PDF]
Discrete Applied Mathematics, 2020 A lucasene is a hexagon chain that is similar to a fibonaccene, an $L$-fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the corresponding lucasene. A new class of cubes, which named after matchable Lucas cubes according to the number of its vertices (or elements), are a series of directed or undirected Hasse
Haiyuan Yao
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Vertex and Edge Orbits of Fibonacci and Lucas Cubes [PDF]
Annals of Combinatorics, 2016 The Fibonacci cube $Γ_n$ is obtained from the $n$-cube $Q_n$ by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube $Λ_n$ is obtained. The number of vertex and edge orbits, the sets of the sizes of the orbits, and the number of orbits of each size, are determined
Jernej Azarija +2 more
exaly +4 more sources
Discrete Applied Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianxin Wei 0001, Yujun Yang
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianxin Wei 0001, Yujun Yang
openaire +2 more sources
Cube-Complements of Fibonacci and Lucas Cubes
Journal of Interconnection NetworksThe 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, 2008We 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.
Ernastuti, Ravi A. Salim, Asep Juarna
openaire +1 more source
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
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
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