Goddard, W. D.; Swart, Henda C. On the integrity of combinations of graphs. (English) Zbl 0696.05047 J. Comb. Math. Comb. Comput. 4, 3-18 (1988). The integrity of a graph G is defined as \(_{S}[| S| +m(G-S)]\) where S is a set of vertices of G and m(G-S) is the order of the largest component of G. Information (bounds or explicit formulae) is obtained for the integrity of the join union and Cartesian and lexicographic products of two graphs; also some results on the integrity of powers of graphs. Reviewer: H.N.V.Temperley Cited in 6 Documents MSC: 05C99 Graph theory Keywords:Cartesian product; integrity of a graph; join union; lexicographic products; powers of graphs PDFBibTeX XMLCite \textit{W. D. Goddard} and \textit{H. C. Swart}, J. Comb. Math. Comb. Comput. 4, 3--18 (1988; Zbl 0696.05047)