References
- Lakaramju V. Koren Z. Koren I. Krishna C. M. (1998) 3rd International Workshop on Embedded HPC Systems and Applications
- Lee H. Kim J. Oh E. Lim H. (2002) Hyper-star graph: A new interconnection network improving the network cost of the hypercube Proc. EurAsia-ICT: Information and Communication Technology Lecture Notes in Computer Science (LNCS) 2510 Springer-Verlag pp. 858–865
- Barefoot , C. A. , Entringer , R. and Swart , H. C. (1987) . Vulnerability in graphs- a comparative survey . J. Combin. Math. Combin. Comput. , 1 : 13 – 22 .
- Cormen T. Leiserson C. E. Rivest R. L. (1990) Introduction to Algorithms 4th ed. The MIT Press
- Chvatal , V. (1973) . Tough graphs Hamiltonian circuits . Discrete Math. , 5 : 215 – 228 .
- Deogun , J. S. , Kratsch , D. and Steiner , G. (1997) . 1-Though co comparability graphs are Hamiltonian . Discrete Math. , 170 : 99 – 106 .
- Kratsch , D. , Kloks , T. and Müller , H. (1997) . Measuring the vulnerability for classes of intersection graphs . Discrete Applied Mathematics , 77 : 259 – 270 .
- Piazza , B. L. , Roberts , F. S. and Stueckle , S. K. (1995) . Edge-tenacious networks . Networks , 25 : 7 – 17 .
- Zhang , S. and Wang , Z. (2001) . Scattering number in graphs . Networks , 37 ( 2 ) : 102 – 106 .
- Jung H. A. (1991) On a class of posets and corresponding graphs (unpublished manuscript)
- Gutman , I. (1998) . Publications De L’institut Mathematique Nouvelle serie, torne . Distance of Thorny Graphs , 63 ( No. 77 ) : pp. 31–36
- Kirlangic , A. (2002) . A measure of graph vulnerability scattering number . International Journal of Mathematics and Mathematical Sciences , 30/1 : 1 – 8 .
- Harary F. (1972) Graph Theory Addison-Wesley Publishing Company