Graph labelings obtainable by random walks

Sela Fried, Toufik Mansour

Research output: Contribution to journalArticlepeer-review


We initiate the study of what we refer to as random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that the labeling occurs increasingly whenever an unlabeled vertex is encountered. Some of the results we obtain involve sums of inverses of binomial coefficients, for which we obtain new identities. In particular, we prove that Σn-1 k=0 2k(2k + 1)-1 (2k k )-1(n+k k ) = (2n n ) 2-nΣn-1 k=0 2k(2k + 1)-1 (2k k )-1, thus confirming a conjecture of Bala.

Original languageEnglish
Article numbere1644
JournalArt of Discrete and Applied Mathematics
Issue number1
StatePublished - 2023

Bibliographical note

Publisher Copyright:
© 2023 University of Primorska. All rights reserved.


  • Random walk
  • graph labeling
  • inverse binomial coefficients

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Graph labelings obtainable by random walks'. Together they form a unique fingerprint.

Cite this