A Pebbling Game on Powers of Paths
Communications on Number Theory and Combinatorial Theory · 2023
DOI: 10.70013/nq3t7kl0 ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications on Number Theory and Combinatorial Theory, 2023. Verfasst von Garth Isaak und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Two Player Graph Pebbling is an extension of graph pebbling. Players Mover and Defender use pebbling moves, the act of removing two pebbles from one vertex and placing one pebble on an adjacent vertex, to win. If a specified vertex has a pebble on it, then Mover wins. If a specified vertex is pebble-free and there are no more valid pebbling moves, then Defender wins. The Two-Player Pebbling Number of a graph G, η(G), is the minimum m such that for every arrangement of m pebbles and for any specified vertex, Mover can win. We specify the winning player for powers of a path.
Zitieren
APA
Isaak, G., & Prudente, M. (2023). A Pebbling Game on Powers of Paths. Communications on Number Theory and Combinatorial Theory. https://doi.org/10.70013/nq3t7kl0
Vancouver
Isaak G, Prudente M. A Pebbling Game on Powers of Paths. Communications on Number Theory and Combinatorial Theory. 2023. doi:10.70013/nq3t7kl0
BibTeX
@article{Isaak2023,
author = {Isaak, Garth and Prudente, Matthew},
title = {A Pebbling Game on Powers of Paths},
journal = {Communications on Number Theory and Combinatorial Theory},
year = {2023},
doi = {10.70013/nq3t7kl0}
}
EUVIMED