Graphs with maximum edge-integrity

Ars Combinatoria

Volumn 46, Issue , 1997, Pages 119-127

  Beineke, Lowell W ^a   Goddard, Wayne ^b   Lipman, Marc J ^c  

^a INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

^b UNIVERSITY OF KWAZULU NATAL   (South Africa)

^c OFFICE OF NAVAL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040691271     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. 1, isoperimetric inequalities for graphs, and superconcentrators, J. Combin. Theory Ser. B 38 (1985), 73-88.
2. K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, On the edge-integrity of graphs, Congress. Numer. 60 (1987), 141-144.
3. K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, Edge-integrity: a survey, Discrete Math. 124 (1994), 3-12.
4. K.S. Bagga, L.W. Beineke, M.J. Lipman, R.E. Pippert and R.L. Sedlmeyer, A good algorithm for the computation of the edge-integrity of trees, Congress. Numer. 67 (1988), 225-232.
5. C.A. Barefoot, R. Eentringer and H.C. Swart, Vulnerability in graphs - A comparative survey, J. Combin. Math. Combin. Comput. 1 (1987), 13-22.
6. C.A. Barefoot, R. Eentringer and H.C. Swart, Integrity of trees and powers of cycles, Congress. Numer. 58 (1987), 103-114.
7. L.W. Beineke, W. Goddard and M.J. Lipman, The edge-integrity of Cartesian products, J. Combin. Math. Combin. Comput. 21 (1996), 129-145.
8. M.R. Fellows and S. Stueckle, The immersion order, forbidden subgraphs and the complexity of network integrity, J. Combin. Math. Combin. Comput. 6 (1989), 23-32.
9. J. Freidman, On the second eigenvalue and random walks in random d-regular graphs, Combinatorica 11 (1991), 331-362.
10. R. Laskar, S. Stueckle and B. Piazza, On the edge-integrity of some graphs and their complements, Discrete Math. 122 (1993), 245-253.
11. M.J. Lipman, The honest cubic graphs, Congress. Numer. 85 (1991), 184-192.