Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 430785, 14 pages
Research Article

Study on the Road Network Connectivity Reliability of Valley City Based on Complex Network

1School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China
2Taiyuan Railway Bureau Party School, Taiyuan 030013, China

Received 8 May 2012; Revised 30 August 2012; Accepted 10 September 2012

Academic Editor: Wuhong Wang

Copyright © 2012 Yong-Sheng Qian et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Based on the research progress in related fields and the distribution characteristics of road networks in valley cities, the complex network model of a city road network is established to study its connectivity reliability. Taking Lanzhou as the example, several parameters of the complex network abstracted from the road network are calculated and the practical meanings of them are described, respectively. On this basis, through computing the global efficiency and the relative size of the largest connecting subgraph under intentional attacks and random attacks, respectively, the curves of the above two parameters varying with the attacking times are drawn. The detailed investigation of connectivity reliability of Lanzhou road network is done by analyzing the curves’ tendency. Finally, we find that the network of a valley city has a poor connection and has a lot of dead ends. Besides, the average length of the roads is very long and the holistic connectivity reliability is at a lower level; these are suitable to the group-type distribution of valley city’s road network, and the connectivity reliability of the road network is stronger under random attacks than that under intentional attacks.