In this paper, a schema of graphical parameters is proposed. Based on
the parameter integrity introduced by Barefoot, Entringer, and Swart,
members PSI(G) of this schema have the general form PSI(G) = min {\S\
+ psi(G - S) : S subset-of V (G)}, where psi(G) is another given graph
ical parameter. Examples include integrity, mean integrity, connectivi
ty, and vertex cover number. General results and bounds for the schema
are derived. Also, properties that characterize such parameters are c
onsidered. (C) 1994 John Wiley & Sons, Inc.