The hub cover pebbling number, h ∗ ( G ) , of a graph G, is the least non-negative integer such that from all distributions of h ∗ ( G ) pebbles over the vertices of G , it is possible to place at least one pebble each on every vertex of a set of vertices of a hub set for G using a sequence of pebbling move operations, each pebbling move operation removes two pebbles from a vertex and places one pebble on an adjacent vertex. Here we compute the hub cover pebbling number for wheel related graphs.
No takes yet. Share an insight, caveat, or question.
Lourdusamy et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: