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 connected and orthoconvex.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.