References
- Chen , C. C. , Koh , K. M. and Peng , Y.-H. 1990 . “ On the higher-order edge toughness of a graph. Graph theory and combinatorics ” . In Discrete Mathematics , Vol. 111 , 113 – 123 . Marseille-Luminy .
- Katona , G. Y. 1994 . “ Toughness and edge-toughness. The 2nd Krakow Conference on Graph Theory ” . In Discrete Mathematics , Vol. 164 , 187 – 196 . Zgorzelisko .
- Nihei , M. 2001 . On the toughness of the middle graph of a graph . Ars Combinatoria , 60 : 55 – 58 .
- Piazza , L. B. , Roberts , F. S. and Stueckle , S. K. 1995 . Edge-tenacious networks . Networks , 25 : 7 – 17 .
- Bagga , K. S. , Beineke , L. W. , Pippert , R. E. and Sedlmeyer , R. L. 1993 . Some bounds and an algorithm for theedge‐integrity of trees . Ars Combinatoria , 35A : 225 – 238 .
- Bagga , K. S. , Beineke , L. W. and Pippert , R. E. 1994 . Edge integrity: a survey . Discrete Mathematics , 124 : 3 – 12 .
- Barefoot , C. A. , Entringer , R. and Swart , H. 1987 . Vulnerability in graphs—a comparative survey . Journal of Combinatorial Mathematics and Combinatorial Computing , 1 : 13 – 22 .
- Cozzens , M. 1994 . Stability measures and data fusion networks . Graph Theory Notes of New York , 26 : 8 – 14 .
- Cozzens , M. , Moazzami , D. and Stueckle , S. The tenacity of a graph: graph theory, combinatorisc, algorithms and applications . Proceedings of the 7th Quadrennial International Conference on the Theory and Applications of Graphs , Vol. 2 , pp. 1111 – 1122 . NewYork : Wiley .
- Cozzens , M. , Moazzami , D. and Stueckle , S. 1994 . The tenacity of Harary graphs . Journal of Combinatorial Mathematics and Combinatorial Computing , 16 : 33 – 56 .
- Chartrand , G. and Lesniak , L. 1986 . Graphs and Digraphs , 2nd edn Wadsworth, Monterey, CA
- Nihei , M. 2003 . Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph . Ars Combinatoria , 69 : 215 – 221 .