Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
