A combinatorial problem on a directed graph
Đã lưu trong:
| Nhiều tác giả: | , |
|---|---|
| Định dạng: | artículo original |
| Trạng thái: | Versión publicada |
| Ngày xuất bản: | 2016 |
| Miêu tả: | 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. |
| Quốc gia: | Portal de Revistas UCR |
| Tổ chức giáo dục: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Ngôn ngữ: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/25267 |
| Truy cập trực tuyến: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/25267 |
| Từ khóa: | grafos orientados juegos en grafos identidades combinatorias probabilidad combinatoria directed graphs games on graphs combinatorial identities combinatorial probability |