Restricted walks in regular trees

Laura Ciobanu; Saša Radomirović

Restricted walks in regular trees

Laura Ciobanu^*
, Saša Radomirović

^*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.

Original language	English
Article number	R93
Journal	Electronic Journal of Combinatorics
Volume	13
Publication status	Published - 27 Oct 2006

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Cite this

@article{7611ade551e24dbca2a8c1f2e74721ff,

title = "Restricted walks in regular trees",

abstract = "Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.",

author = "Laura Ciobanu and Sa{\v s}a Radomirovi{\'c}",

year = "2006",

month = oct,

day = "27",

language = "English",

volume = "13",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

}

TY - JOUR

T1 - Restricted walks in regular trees

AU - Ciobanu, Laura

AU - Radomirović, Saša

PY - 2006/10/27

Y1 - 2006/10/27

N2 - Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.

AB - Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.

UR - https://www.scopus.com/pages/publications/33750447021

M3 - Article

AN - SCOPUS:33750447021

SN - 1077-8926

VL - 13

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

M1 - R93

ER -

Restricted walks in regular trees

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this