References
- Bagga , K.S. , Beineke , L.W. , Goddard , W.D. , Lipman , M.J. and Pippert , R.E. 1992 . A Survey of Integrity . Discrete Applied Mathematics , 37 ( 38 ) : 13 – 28 .
- Bagga , K.S. , Beineke , L.W. , Lipman , M.J. and Pippert , R.E. 1994 . Edge-Integrity: A Survey . Discrete Mathematics , 124 ( 38 ) : 3 – 12 .
- Barefoot , C.A. , Entringer , R. and Swart , H. 1987 . Vulnerability in Graphs-A Comparative Survey . J. Combin. Math. Combin. Comput , 1 ( 38 ) : 13 – 22 .
- Cozzens , M.B. 1994 . “ Stability Measures and Data Fusion Networks ” . In Graph Theory Notes of New York XXVI 8 – 14 .
- Cozzens , M.B. , Moazzami , D. and Stueckle , S. 1994 . The Tenacity of a Graph . Siam Journal Discrete Math , : 1111 – 1122 .
- Cozzens , M.B. and Wu , S.Y. 1994 . Edge-Neighbour-Integrity of Trees . Australian Journal of Combinatorics , 10 : 163 – 174 .
- Cozzens , M.B. and Wu , S.Y. 1996 . Vertex-Neighbour-Integrity of Trees . Ars Combinatoria , 43 : 169 – 180 .
- Cozzens , M.B. and Wu , S.Y. 1997 . Bounds of Edge-Neighbour-Integrity of Graphs . Australian Journal of Combinatorics , 15 : 71 – 80 .
- Goddard , W. and Swart , H.C. 1990 . On the Toughness of a Graph . Questiones Math , 13 : 217 – 232 .
- Harary , F. 1972 . Graph Theory , Addison-Wesley Publishing Company .
- Woodal , D.R. 1973 . The Binding Number of a Graph and its Anderson Number . Journal of Combinatorial Theory , 15 : 225 – 255 .