Download or read book Geodesic Convexity in Discrete Spaces written by Azriel Rosenfeld and published by . This book was released on 1994 with total page 6 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "A pebbled graph is called '(geodesically) convex' if at least one shortest path between any two unpebbled nodes has no pebbles on any of its nodes. There exist conditions on the node neighborhoods in a pebbled graph that imply convexity; but no such conditions can be necessary for convexity. The convex pebblings can be characterized for various special types of graphs, such as cycles, trees, and cliques. For a graph L whose nodes are the lattice points in the plane under the relation of row or column adjacency, we show that a pebbling of L is convex iff the set of unpebbled nodes is conected and orthoconvex."