Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Edge-Integrity of Cartesian Products

Lowell W. Beineke 1, Wayne Goddard 2, Mare J. Lipman 3
1Indiana-Purdue University at Fort Wayne Fort Wayne, IN 46805 USA
2University of Natal Durban 4000 South Africa
3Office of Naval Research Arlington VA 22217 USA
  • Published: 30/06/1996

Abstract

The edge-integrity of a graph measures the difficulty of breaking it into pieces through the removal of a set of edges, taking into account both the number of edges removed and the size of the largest surviving component. We develop some techniques for bounding, estimating and computing the edge-integrity of products of graphs, paying particular attention to grid graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Lowell W. Beineke , Wayne Goddard , Mare J. Lipman . The Edge-Integrity of Cartesian Products[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 021. 129-145. DOI: .