55 research outputs found
Ramified rectilinear polygons: coordinatization by dendrons
Simple rectilinear polygons (i.e. rectilinear polygons without holes or
cutpoints) can be regarded as finite rectangular cell complexes coordinatized
by two finite dendrons. The intrinsic -metric is thus inherited from the
product of the two finite dendrons via an isometric embedding. The rectangular
cell complexes that share this same embedding property are called ramified
rectilinear polygons. The links of vertices in these cell complexes may be
arbitrary bipartite graphs, in contrast to simple rectilinear polygons where
the links of points are either 4-cycles or paths of length at most 3. Ramified
rectilinear polygons are particular instances of rectangular complexes obtained
from cube-free median graphs, or equivalently simply connected rectangular
complexes with triangle-free links. The underlying graphs of finite ramified
rectilinear polygons can be recognized among graphs in linear time by a
Lexicographic Breadth-First-Search. Whereas the symmetry of a simple
rectilinear polygon is very restricted (with automorphism group being a
subgroup of the dihedral group ), ramified rectilinear polygons are
universal: every finite group is the automorphism group of some ramified
rectilinear polygon.Comment: 27 pages, 6 figure
Maximal proper subgraphs of median graphs
AbstractFor a median graph G and a vertex v of G that is not a cut-vertex we show that G-v is a median graph precisely when v is not the center of a bipartite wheel, which is in turn equivalent with the existence of a certain edge elimination scheme for edges incident with v. This implies a characterization of vertex-critical (respectively, vertex-complete) median graphs, which are median graphs whose all vertex-deleted subgraphs are not median (respectively, are median). Moreover, two analogous characterizations for edge-deleted median graphs are given
Cubic Partial Cubes from Simplicial Arrangements
We show how to construct a cubic partial cube from any simplicial arrangement
of lines or pseudolines in the projective plane. As a consequence, we find nine
new infinite families of cubic partial cubes as well as many sporadic examples.Comment: 11 pages, 10 figure
Bucolic Complexes
We introduce and investigate bucolic complexes, a common generalization of
systolic complexes and of CAT(0) cubical complexes. They are defined as simply
connected prism complexes satisfying some local combinatorial conditions. We
study various approaches to bucolic complexes: from graph-theoretic and
topological perspective, as well as from the point of view of geometric group
theory. In particular, we characterize bucolic complexes by some properties of
their 2-skeleta and 1-skeleta (that we call bucolic graphs), by which several
known results are generalized. We also show that locally-finite bucolic
complexes are contractible, and satisfy some nonpositive-curvature-like
properties.Comment: 45 pages, 4 figure
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
- …