On super i-connected graphs

Inclusive connectivity parameters are measures of local connectivity that are natural restrictions of standard graph connectivity and edge connectivity. We examine the i-connectivity analogs of super-k and super-λ graphs. The primary results here concern the graphs G + K2, i.e., the join of an arbitrary graph with K2. We show that G + K2 is super λ1-connected for every v ϵ V(G) and every edge e ϵ E(G). Using these local results, we show G + Kn, n ⩾ 2, is super λ-connected. © 1994 by John Wiley & Sons, Inc.