Random walk labelings of perfect trees and other graphs

Abstract

A random walk labeling of a graph G is any labeling of G that could have been obtained by performing a random walk on G. Continuing two recent works, we calculate the number of random walk labelings of perfect trees, combs, and double combs, the torus C ₂ × C_n , and the graph obtained by connecting three path graphs at their ends.