Random Walk Labelings of Perfect Trees and Other Graphs
Combinatorics
2023-08-02 v1
Abstract
A Random walk labeling of a graph is any labeling of that could have been obtained by performing a random walk on . Continuing two recent works, we calculate the number of random walk labelings of perfect trees, combs, and double combs, the torus , and the graph obtained by connecting three path graphs to form two cycles.
Cite
@article{arxiv.2308.00315,
title = {Random Walk Labelings of Perfect Trees and Other Graphs},
author = {Sela Fried and Toufik Mansour},
journal= {arXiv preprint arXiv:2308.00315},
year = {2023}
}
Comments
16 pages