Theoretical progress on infinite graphs and their average degree: applicability to the European Road Transport Network
There are many problems in Graph Theory for finite graphs relating the number of vertices and the number of edges and, therefore, related to the average degree for finite graphs. However, when dealing with real-life problems involving networks, it is often useful to model the situation by using infi...
| Autores: | , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/154238 |
| Acceso en línea: | https://hdl.handle.net/11441/154238 https://doi.org/10.1109/MCSI.2015.56 |
| Access Level: | acceso abierto |
| Palabra clave: | Infinite graph average degree complete graph road transport network percolation |
| Sumario: | There are many problems in Graph Theory for finite graphs relating the number of vertices and the number of edges and, therefore, related to the average degree for finite graphs. However, when dealing with real-life problems involving networks, it is often useful to model the situation by using infinite graphs, which can represent extendable systems. In this paper, we will generalize the concept of average degree for infinite graphs in a family of graphs that we call average-measurable. Besides, this new definition allows the generalization of the universal formulae for evaluation of percolation thresholds |
|---|