Random walk labelings of perfect trees and other graphs

Sela Fried; Toufik Mansour

doi:10.2989/16073606.2025.2458800

Random walk labelings of perfect trees and other graphs

Sela Fried, Toufik Mansour

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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₂ × C_n, and the graph obtained by connecting three path graphs at their ends.

Original language	English
Journal	Quaestiones Mathematicae
DOIs	https://doi.org/10.2989/16073606.2025.2458800
State	Accepted/In press - 2025

Bibliographical note

Publisher Copyright:
© 2025 NISC (Pty) Ltd.

Keywords

graph labeling
perfect tree
Random walk

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.2989/16073606.2025.2458800

Cite this

@article{73e49c9c0e454f748048a28d721f461e,

title = "Random walk labelings of perfect trees and other graphs",

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 C2 × Cn, and the graph obtained by connecting three path graphs at their ends.",

keywords = "graph labeling, perfect tree, Random walk",

author = "Sela Fried and Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2025 NISC (Pty) Ltd.",

year = "2025",

doi = "10.2989/16073606.2025.2458800",

language = "English",

journal = "Quaestiones Mathematicae",

issn = "1607-3606",

publisher = "Taylor and Francis",

}

TY - JOUR

T1 - Random walk labelings of perfect trees and other graphs

AU - Fried, Sela

AU - Mansour, Toufik

PY - 2025

Y1 - 2025

N2 - 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 C2 × Cn, and the graph obtained by connecting three path graphs at their ends.

AB - 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 C2 × Cn, and the graph obtained by connecting three path graphs at their ends.

KW - graph labeling

KW - perfect tree

KW - Random walk

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

U2 - 10.2989/16073606.2025.2458800

DO - 10.2989/16073606.2025.2458800

M3 - Article

AN - SCOPUS:85216659334

SN - 1607-3606

JO - Quaestiones Mathematicae

JF - Quaestiones Mathematicae

ER -

Random walk labelings of perfect trees and other graphs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this