A combinatorial problem on a directed graph
שמור ב:
| Autores: | , |
|---|---|
| פורמט: | artículo original |
| סטטוס: | Versión publicada |
| Fecha de Publicación: | 2016 |
| תיאור: | 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. |
| País: | Portal de Revistas UCR |
| מוסד: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| שפה: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/25267 |
| גישה מקוונת: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/25267 |
| מילת מפתח: | grafos orientados juegos en grafos identidades combinatorias probabilidad combinatoria directed graphs games on graphs combinatorial identities combinatorial probability |