A combinatorial problem on a directed graph

Osvaldo Marrero; Paul C. Pasles

doi:10.15517/rmta.v23i2.25267

Vol. 23 No. 2 (2016), Articles

Vol. 23 No. 2 (2016)

A combinatorial problem on a directed graph

Articles

https://doi.org/10.15517/rmta.v23i2.25267

Published August 4, 2016

Osvaldo Marrero⁺⁻
Paul C. Pasles⁺⁻

Osvaldo Marrero

Department of Mathematics and Statistics, Villanova University, Villanova, Pennsylvania, U.S.A.

Paul C. Pasles

Department of Mathematics and Statistics, Villanova University, Villanova, Pennsylvania, U.S.A.

PDF (Español (España))

Keywords

grafos orientados
juegos en grafos
identidades combinatorias
probabilidad combinatoria
directed graphs
games on graphs
combinatorial identities
combinatorial probability

How to Cite

Marrero, O., & Pasles, P. C. (2016). A combinatorial problem on a directed graph. Revista De Matemática: Teoría Y Aplicaciones, 23(2), 409–420. https://doi.org/10.15517/rmta.v23i2.25267

Abstract

We consider two options for a particle’s entire journey through a certaindirectedgraph. Both options involve a random assignment to the journey route to be followed. We are interested in the option that offers, on average, the shortest route. Therefore, we determine the average journey length for each of the two options. As part of our analysis, we provesome combinatorial identities that appear to be new. Some suggestions for further work are given.

https://doi.org/10.15517/rmta.v23i2.25267

PDF (Español (España))