Further results on random walk labelings

Sela Fried; Toufik Mansour

doi:10.1016/j.dam.2024.04.030

Further results on random walk labelings

Sela Fried, Toufik Mansour

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	211-221
Number of pages	11
Journal	Discrete Applied Mathematics
Volume	353
DOIs	https://doi.org/10.1016/j.dam.2024.04.030
State	Published - 15 Aug 2024
Externally published	Yes

Keywords

Graph labeling
Random walk

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2024.04.030

Cite this

@article{b0c548f09a2c4158b77752da126b77f3,

title = "Further results on random walk labelings",

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.",

keywords = "Graph labeling, Random walk",

author = "Sela Fried and Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2024 Elsevier B.V.",

year = "2024",

month = aug,

day = "15",

doi = "10.1016/j.dam.2024.04.030",

language = "English",

volume = "353",

pages = "211--221",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Further results on random walk labelings

AU - Fried, Sela

AU - Mansour, Toufik

PY - 2024/8/15

Y1 - 2024/8/15

N2 - 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.

AB - 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.

KW - Graph labeling

KW - Random walk

UR - http://www.scopus.com/inward/record.url?scp=85192965814&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2024.04.030

DO - 10.1016/j.dam.2024.04.030

M3 - Article

AN - SCOPUS:85192965814

SN - 0166-218X

VL - 353

SP - 211

EP - 221

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Further results on random walk labelings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this