Further results on random walk labelings

Sela Fried, Toufik Mansour

Research output: Contribution to journalArticlepeer-review

Abstract

In a previous work, we defined and studied random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that each vertex is labeled upon its first visit. In this work, we calculate the number of random walk labelings of several natural graph families: The wheel, fan, barbell, lollipop, tadpole, friendship, and snake graphs. Additionally, we prove several combinatorial identities that emerged during the calculations.

Original languageAmerican English
Pages (from-to)211-221
Number of pages11
JournalDiscrete Applied Mathematics
Volume353
DOIs
StatePublished - 15 Aug 2024

Keywords

  • Graph labeling
  • Random walk

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Further results on random walk labelings'. Together they form a unique fingerprint.

Cite this