A combinatorial problem on a directed graph
Αποθηκεύτηκε σε:
| Συγγραφείς: | , |
|---|---|
| Μορφή: | artículo original |
| Κατάσταση: | Versión publicada |
| Ημερομηνία έκδοσης: | 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. |
| Χώρα: | Portal de Revistas UCR |
| Ίδρυμα: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Γλώσσα: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/25267 |
| Διαθέσιμο Online: | 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 |