Research Article

Random walk labelings of perfect trees and other graphs

Published in: Quaestiones Mathematicae
Volume 48 , issue 6 : Entrepreneurship and Africa’s Cultural Context , 2024 , pages: 879–901
DOI: 10.2989/16073606.2025.2458800
Author(s): Sela Fried Israel Academic College, Israel, Toufik Mansour University of Haifa, Israel,
Keywords: 05C78, 05A10, 05A15, 05C81, Random walk, graph labeling, perfect tree,
Download full text Get new issue alerts

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 2 × Cn , and the graph obtained by connecting three path graphs at their ends.
« Complementary bounds for the numerical and spectral radii
Geometric mean Sylow numbers of nonsolvable groups »

Get new issue alerts for Quaestiones Mathematicae

CAPTCHA Reload CAPTCHA