Bounds of edge-neighbor-integrity of graphs

Australasian Journal of Combinatorics

Volumn 15, Issue , 1997, Pages 71-80

  Cozzens, Margaret B ^a   Wu, Shu Shih Y ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004865667     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. C. A. Barefoot, R. Entringer and H. Swart, Vulnerability in Graphs-a Comparative Survey, J. Combin. Math. Combin. Compo 1 (1987) 13-22.
2. C. A. Barefoot. R. Entringer and H. Swart, Integrity of Trees and Powers of Cycles, Congr. Numer. 58 (1987) 103-114.
3. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (The Macmillan Press Ltd, 1976).
4. M. B. Cozzens and S.-S. Y. Wu, Edge-Neighbor-Integrity of Trees, Australas. J. Combin. 10 (1994), 163-174.
5. M. B. Cozzens and S.-S. Y. Wu, Extreme Values of the Edge-NeighborConnectivity, Ars Combinatoria 39 (1995), 199-210.
6. M. B. Cozzens and S.-S. Y. Wu, Vertex-Neighbor-Integrity of Trees, Ars Combinatoria (1996), in press.
7. M. B. Cozzens and S.-S. Y. Wu, Vertex-Neighbor-Integrity of Powers of Cycles, Ars Combinatoria (1996), in press.
8. W. Goddard and H. C. Swart, Integrity in Graphs: Bounds and Basics, J. Combin. Math. Combin. Comput. 7 (1990) 139-151.
9. S.-S. Y. Wu and M. B. Cozzens, The Minimum Size of Critically m-NeighborConnected Graphs, Ars Combinatoria 29 (1990) 149-160.