Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, 2024. Verfasst von A. Lourdusamy und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Lourdusamy, A., Beaula, F. J., & Patrick, F. (2024). Hub Cover Pebbling Number. Ars Combinatoria. https://doi.org/10.61091/ars-160-05
Vancouver
Lourdusamy A, Beaula FJ, Patrick F. Hub Cover Pebbling Number. Ars Combinatoria. 2024. doi:10.61091/ars-160-05
BibTeX
@article{Lourdusamy2024,
author = {Lourdusamy, A. and Beaula, F. Joy and Patrick, F.},
title = {Hub Cover Pebbling Number},
journal = {Ars Combinatoria},
year = {2024},
doi = {10.61091/ars-160-05}
}
EUVIMED