Further Results on Random Walk Labelings

DOI10.1016/J.DAM.2024.04.030MaRDI QIDQ6436912zbMATH OpenOpenAlexFDO

Authors Sela Fried, Toufik Mansour

Publication date 17 May 2023

Full work available at URL https://doi.org/10.1016/j.dam.2024.04.030

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Random walks on graphs (05C81)

Abstract: Recently, we initiated the study of 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.

Recommendations

• Graph labelings obtainable by random walks
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• scientific article; zbMATH DE number 878897
• Graph lattice: random walk and combinatorial identities
• Formal rational fractions and random walks on cycles

Cited in

(2)

• Graph labelings obtainable by random walks
• Random walk labelings of perfect trees and other graphs

This page was built for publication: Further Results on Random Walk Labelings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6436912)