A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH
Fuente:
Redalyc
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artículo científico |
| Langue: | en |
| Publié: |
Universidad de Costa Rica
2016
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1876444378533199872 |
|---|---|
| author | OSVALDO MARRERO |
| author_facet | OSVALDO MARRERO |
| contents | A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH OSVALDO MARRERO PAUL C. PASLES Física, Astronomía y Matemáticas Directed graphs games on graphs combinatorial identities combinatorial probability We consider two options for a particle’s entire journey through a cer- tain directed graph. Both options involve a random assignment to the jour- ney 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 prove some combinatorial identities that appear to be new. Some suggestions for fur- ther work are given. 2016 artículo científico 1409-2433 https://www.redalyc.org/articulo.oa?id=45349329005 en http://www.redalyc.org/revista.oa?id=453 Revista de Matemática: Teoría y Aplicaciones application/pdf Universidad de Costa Rica Revista de Matemática: Teoría y Aplicaciones (Costa Rica) Num.2 Vol.23 |
| format | Artículo científico |
| id | redalyc_45349329005 |
| institution | Redalyc |
| language | en |
| publishDate | 2016 |
| publisher | Universidad de Costa Rica |
| spellingShingle | A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH OSVALDO MARRERO Física, Astronomía y Matemáticas Directed graphs games on graphs combinatorial identities combinatorial probability A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH OSVALDO MARRERO PAUL C. PASLES Física, Astronomía y Matemáticas Directed graphs games on graphs combinatorial identities combinatorial probability We consider two options for a particle’s entire journey through a cer- tain directed graph. Both options involve a random assignment to the jour- ney 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 prove some combinatorial identities that appear to be new. Some suggestions for fur- ther work are given. 2016 artículo científico 1409-2433 https://www.redalyc.org/articulo.oa?id=45349329005 en http://www.redalyc.org/revista.oa?id=453 Revista de Matemática: Teoría y Aplicaciones application/pdf Universidad de Costa Rica Revista de Matemática: Teoría y Aplicaciones (Costa Rica) Num.2 Vol.23 |
| title | A COMBINATORIAL PROBLEM ON A DIRECTED GRAPH |
| topic | Física, Astronomía y Matemáticas Directed graphs games on graphs combinatorial identities combinatorial probability |
| url | https://www.redalyc.org/articulo.oa?id=45349329005 |