Asymptotic behaviour of the observability of Qn
Discrete Mathematics
Structural and enumerative properties of the Fibonacci cubes
Discrete Mathematics
Fibonacci Cubes-A New Interconnection Topology
IEEE Transactions on Parallel and Distributed Systems
Observability of the extended Fibonacci cubes
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Minimal change list for Lucas strings and some graph theoretic consequences
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Computers & Mathematics with Applications
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
Journal of Combinatorial Optimization
| Hi-index | 0.05 |
The Fibonacci cube Γn is the graph whose vertices are binary strings of length n without two consecutive 1's and two vertices are adjacent when their Hamming distance is exactly 1. If the binary strings do not contain two consecutive 1's nor a 1 in the first and in the last position, we obtain the Lucas cube Ln. We prove that the observability of Γn and Ln is n, where the observability of a graph G is the minimum number of colors to be assigned to the edges of G so that the coloring is proper and the vertices are distinguished by their color sets.