An advance in infinite graph models for the analysis of transportation networks

DOI10.1515/amcs-2016-0061zbMath1355.05138OpenAlexW2579054353MaRDI QIDQ511389

Eugenio M. Fedriani, Martín Cera

Publication date: 15 February 2017

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2016-0061

zbMATH Keywords

percolationinfinite graphextremal problemsaverage degreeroad transport network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal path planning problem for heterogeneous multi-vehicle systems
• Calculating the edge Wiener and edge Szeged indices of graphs
• Local dependency in networks
• Bemerkungen zu Hadwigers Vermutung
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Largest planar graphs and largest maximal planar graphs of diameter two
• Extremal infinite graph theory
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Applications of percolation theory
• Forcing Large Complete (Topological) Minors in Infinite Graphs
• Modeling nonlinear road traffic networks for junction control
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• The Size of a Graph Without Topological Complete Subgraphs
• Estimation From Relative Measurements: Electrical Analogy and Large Graphs
• Extremal Graphs without Topological Complete Subgraphs