The \(t\)-pebbling number of graphs (Q2459002): Difference between revisions

The \(t\)-pebbling number was introduced by \textit{D. S. Herscovici} and \textit{A. W. Higgins} [Discrete Math. 187, No.\,1-3, 123-135 (1998; Zbl 0955.05106)]. The authors prove that the \(t\)-pebbling number of a complete graph on \(n\) vertices is \(2t + n -2,\) of an \(n\)-star \(4t + n - 2,\) of a connected path \(t(2^n)\), and of a \(n\)-cube \(t(2^n).\) They establish that the \(t\)-pebbling number of a tree with diameter \(d\) is \(t(2^d)\) if and only if it is a path.