Artículo
An advance in infinite graph models for the analysis of transportation networks
Autor/es | Cera López, Martín
Fedriani Martel, Eugenio Manuel |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2016 |
Fecha de depósito | 2017-08-29 |
Publicado en |
|
Resumen | This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum
number of edges of a graph not containing a given subgraph. It also relates the new results with the ... This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph. It also relates the new results with the corresponding situations for the finite case. In particular, concepts from ‘finite’ graph theory, like the average degree and the extremal number, are generalized and computed for some specific cases. Finally, some applications of infinite graphs to the transportation of dangerous goods are presented; they involve the analysis of networks and percolation thresholds. |
Agencias financiadoras | European Union (UE) |
Identificador del proyecto | G-GI3003/IDIL |
Cita | Cera López, M. y Fedriani Martel, E.M. (2016). An advance in infinite graph models for the analysis of transportation networks. International Journal of Applied Mathematics and Computer Science, 2016 (26 (4)), 855-870. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
An advance in infinite graph ... | 427.7Kb | [PDF] | Ver/ | |