We study the largest minimum makespan of labeled pebble motion on graphs under a model that permits synchronous pebble movement. While classical pebble motion on graphs allows only one pebble to move at a time, our model permits any number of pebbles to move to an adjacent vertex, provided that no two pebbles collide. At full occupancy every vertex is assigned a pebble and a legal round consists of disjoint cycle rotations. We prove a series of makespan bounds for this problem on graphs with varying structure and pebble density. For cycles with a chord, we extend a known quadratic bound at span two to every fixed span. For random cubic graphs, we convert permutation routing via matchings into legal schedules in two ways, applying cycle-cover batching at full occupancy and disjoint vacancy-delivery paths below full occupancy. For simple 3-connected planar cubic graphs, we prove a tight linear class maximum at every pebble count. We extend the results to increasing degree, common-neighbor conditions, and vertex connectivity. The results describe how graph connectivity, cycle structure, expansion, planarity, and occupancy affect worst-case routing time.

翻译：暂无翻译