Results 1 to 10 of about 64 (61)
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
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 +3 more sources
On the existence of cycles of every even length on generalized Fibonacci cubes
Le Matematiche, 1996 A new topology for the interconnection of computing nodes in multiprocessors systems is the generalized Fibonacci cube.It can be embedded as a subgraph in the Boolean cube and it is also a supergraph of other structures.
Norma Zagaglia Salvi
doaj +2 more sources
Edge General Position Sets in Fibonacci and Lucas Cubes
Bulletin of the Malaysian Mathematical Sciences Society, 2023 AbstractA set of edges$$X\subseteq E(G)$$X⊆E(G)of a graphGis an edge general position set if no three edges fromXlie on a common shortest path inG. The cardinality of a largest edge general position set ofGis the edge general position number ofG. In this paper, edge general position sets are investigated in partial cubes.
Sandi Klavžar, Elif Tan
openaire +6 more sources
The infinite Fibonacci cube and its generalizations
, 2023 The Fibonacci cube $Γ_n$ is is the graph whose vertices are independent subsets of the path graph of length $n$, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klavžar [1] suggested considering the infinite Fibonacci cube $Γ_\infty$ whose vertices are independent subsets of the one-way ...
Trinh, Hiep, Wilson, Trevor M.
openaire +2 more sources
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilić, Aleksandar +2 more
openaire +1 more source
On isomorphism classes of generalized Fibonacci cubes
European Journal of Combinatorics, 2016 The generalized Fibonacci cube $Q_d(f)$ is the subgraph of the $d$-cube $Q_d$ induced on the set of all strings of length $d$ that do not contain $f$ as a substring. It is proved that if $Q_d(f) \cong Q_d(f')$ then $|f|=|f'|$. The key tool to prove this result is a result of Guibas and Odlyzko about the autocorrelation polynomial associated to a binary
Azarija, Jernej +4 more
openaire +3 more sources
Asymptotic number of isometric generalized Fibonacci cubes
European Journal of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klavžar, Sandi, Shpectorov, Sergey
openaire +1 more source
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.
Klavžar, Sandi, Rho, Yoomi
openaire +1 more source
Proofs of two conjectures on generalized Fibonacci cubes
European Journal of Combinatorics, 2016 A binary string $f$ is a factor of string $u$ if $f$ appears as a sequence of $|f|$ consecutive bits of $u$, where $|f|$ denotes the length of $f$. Generalized Fibonacci cube $Q_{d}(f)$ is the graph obtained from the $d$-cube $Q_{d}$ by removing all vertices that contain a given binary string $f$ as a factor. A binary string $f$ is called good if $Q_{d}
Jianxin Wei, Heping Zhang
openaire +3 more sources