Mathematics – Combinatorics
Scientific paper
2009-03-13
Mathematics
Combinatorics
20 pages, 6 figures
Scientific paper
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of the isometric and lattice dimension, provide a combinatorial characterization of the Fibonacci dimension using properties of an associated graph, and establish the Fibonacci dimension for certain families of graphs. From the algorithmic point of view we prove that it is NP-complete to decide if fdim(G) equals to the isometric dimension of G, and that it is also NP-hard to approximate fdim(G) within (741/740)-epsilon. We also give a (3/2)-approximation algorithm for fdim(G) in the general case and a (1+epsilon)-approximation algorithm for simplex graphs.
Cabello Sergio
Eppstein David
Klavzar Sandi
No associations
LandOfFree
The Fibonacci dimension of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Fibonacci dimension of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Fibonacci dimension of a graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-235789