1-Restricted Optimal Rubbling on Graphs

Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from each of two neighbors of a vertex v and placing...

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Beeler Robert A., Haynes Teresa W., Murphy Kyle
Materyal Türü: Makale
Dil:English
Baskı/Yayın Bilgisi: University of Zielona Góra 2019-05-01
Seri Bilgileri:Discussiones Mathematicae Graph Theory
Konular:
Online Erişim:https://doi.org/10.7151/dmgt.2102