16 research outputs found
Generalized Fibonacci cubes
AbstractGeneralized Fibonacci cube Qd(f) is introduced as the graph obtained from the d-cube Qd by removing all vertices that contain a given binary string f as a substring. In this notation, the Fibonacci cube Γd is Qd(11). The question whether Qd(f) is an isometric subgraph of Qd is studied. Embeddable and non-embeddable infinite series are given. The question is completely solved for strings f of length at most five and for strings consisting of at most three blocks. Several properties of the generalized Fibonacci cubes are deduced. Fibonacci cubes are, besides the trivial cases Qd(10) and Qd(01), the only generalized Fibonacci cubes that are median closed subgraphs of the corresponding hypercubes. For admissible strings f, the f-dimension of a graph is introduced. Several problems and conjectures are also listed
The degree sequence of Fibonacci and Lucas cubes
AbstractThe Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained from Γn by removing vertices that start and end with 1. It is proved that the number of vertices of degree k in Γn and Λn is ∑i=0k(n−2ik−i)(i+1n−k−i+1) and ∑i=0k[2(i2i+k−n)(n−2i−1k−i)+(i−12i+k−n)(n−2ik−i)], respectively. Both results are obtained in two ways, since each of the approaches yields additional results on the degree sequences of these cubes. In particular, the number of vertices of high resp. low degree in Γn is expressed as a sum of few terms, and the generating functions are given from which the moments of the degree sequences of Γn and Λn are easily computed
09451 Abstracts Collection -- Geometric Networks, Metric Space Embeddings and Spatial Data Mining
From November 1 to 6, 2009, the Dagstuhl Seminar 09451 ``Geometric Networks, Metric Space Embeddings and Spatial Data Mining\u27\u27 was held
in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
Any two reduced expressions for the same Coxeter group element are related by
a sequence of commutation and braid moves. We say that two reduced expressions
are braid equivalent if they are related via a sequence of braid moves, and the
corresponding equivalence classes are called braid classes. Each braid class
can be encoded in terms of a braid graph in a natural way. In this paper, we
study the structure of braid graphs in simply-laced Coxeter systems. We prove
that every reduced expression has a unique factorization as a product of
so-called links, which in turn induces a decomposition of the braid graph into
a box product of the braid graphs for each link factor. When the Coxeter graph
has no three-cycles, we use the decomposition to prove that braid graphs are
partial cubes, i.e., can be isometrically embedded into a hypercube. For a
special class of links, called Fibonacci links, we prove that the corresponding
braid graphs are Fibonacci cubes.Comment: 24 page, 11 figure
Recommended from our members
The Fibonacci dimension of a graph
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 whether fdim(G) equals the isometric dimension of G, and show that no algorithm to approximate fdim(G) has approximation ratio below 741/740, unless P=NP. We also give a (3/2)-approximation algorithm for fdim(G) in the general case and a (1+epsilon)-approximation algorithm for simplex graphs
The Fibonacci dimension of a graph
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 viewwe prove that it is NP-complete to decide if fdim( G) equals to the isometric dimensionof G, and that it is also NP-hard to approximate fdim(G) within (741/740)- ". We also give a (