# Graph Theory Approach to the Vulnerability of Transportation Networks
## 3 Results
### Structural Transportation Network Vulnerability
* (28) [PERSON] Studies in Graph Theory: Covering, Independence, Domination and Related Topics. Ph.D. Thesis, Manonmaniam Sundaranar University, Tirunelveli, India, 1997. * (29) [PERSON]; [PERSON]; [PERSON] Domination and independence subdivision numbers of graphs. _Discuss. Math. Graph Theory_**2000**, _20_, 271-280. [CrossRef]
* (30) [PERSON] Graph Theory Approach to Transportation Systems Design and Optimization. _Int. J. Mar. Navig. Saf. Sea Transp._**2014**, \(8\), 571-578. [CrossRef]
* (31) [PERSON] An application of the selected graph theory domination concepts to transportation networks modelling. _Sci. J. Marit._**2017**, _52_, 97-102. * (32) [PERSON]; [PERSON] Effect of edge-subdivision on vertex-domination in a graph. _Discuss. Math. Graph Theory_**2002**, _vol. 22_, 335-347. [CrossRef]
* (33) [PERSON]; [PERSON]; [PERSON] _Recent Developments in the Theory of Domination in Graphs_; Mehta Research Institute of Mathematics: Allahabad, India, 1979; Volume 1. Available online: [[https://www.tib.eu/en/search/id/TIBKAT%3A014901056/Recent-developments-in-the-theory-of-domination/](https://www.tib.eu/en/search/id/TIBKAT%3A014901056/Recent-developments-in-the-theory-of-domination/)]([https://www.tib.eu/en/search/id/TIBKAT%3A014901056/Recent-developments-in-the-theory-of-domination/](https://www.tib.eu/en/search/id/TIBKAT%3A014901056/Recent-developments-in-the-theory-of-domination/)) (accessed on 11 December 2019). * (34) [PERSON] Analysis of Greedy Heuristic for Finding Small Dominating Sets in Graphs. _Inf. Process. Lett._**1991**, _39_, 237-240. [CrossRef]
* (35) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]. A greedy approximation for minimum connected dominating sets. _Theor. Comput. Sci._**2004**, _329_, 325-330. [CrossRef]* [PERSON] (1993) [PERSON] Graph with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices. _Discret. Math._ **1993**, _121_, 199-210. [CrossRef]
* [PERSON] et al. (1990) [PERSON]; [PERSON]; [PERSON]; [PERSON] The bondage number of graph. _Discret. Math._**1990**, _86_, 47-57. [CrossRef]
* [PERSON] (1994) [PERSON]; [PERSON] Bounds on the bondage number of a graph. _Discret. Math._, **1994**, _128_, 173-177. [CrossRef]
* [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON] Domination Subdivision and Domination Multisubdivision Numbers of Graphs. _Discuss. Math. Graph Theory_**2019**, _39_, 829-839. [CrossRef]
* [PERSON] (2002) [PERSON] An introduction to road vulnerability: What has been done, is done and should be done. _Transp. Policy_**2002**, \(9\), 117-127. [CrossRef]
* [PERSON] and [PERSON] (2013) [PERSON]; [PERSON] Measuring Urban Road Network Vulnerability using Graph Theory: The Case of Montpellier's Road Network. Working Paper. 2013; pp. 1-8. Available online: [[https://halshs.archives-ouvertes.fr/halshs-00841520/document](https://halshs.archives-ouvertes.fr/halshs-00841520/document)]([https://halshs.archives-ouvertes.fr/halshs-00841520/document](https://halshs.archives-ouvertes.fr/halshs-00841520/document)) (accessed on 30 November 2019). * [PERSON] and [PERSON] (2004) [PERSON]; [PERSON] Regional accessibility analysis from a vulnerability perspectiv. In Proceedings of the Second International Symposium on Transportation Network Reliability (INSTR), Christchurch and Queenstown, New Zealand, 20-24 August 2004; pp. 89-94. * [PERSON] and [PERSON] (2003) [PERSON]; [PERSON]. Network vulnerability: An approach to reliability analysis at the level of national strategic transport networks. In _The Network Reliability of Transport, Emerald Group Publishing Limited_; [PERSON], [PERSON]; Pergamon: Oxford, UK, 2003; pp. 23-44. [CrossRef]
* [PERSON] and [PERSON] (1997) [PERSON]; [PERSON] Degradable transportation systems: Sensitivity and reliability analysis. _Transp. Res. Part Methodol._**1997**, _31_, 225-237 [CrossRef]
* [PERSON] (2004) [PERSON] Reliability and vulnerability versus cost and benefits.