Malde, Paresh J.; Oellermann, Ortrud R. The F-connectivity of a graph. (English) Zbl 0687.05030 Sci., Ser. A 1, 65-71 (1988). The paper introduces a new type of conditional connectivity; F- connectivity of a graph G. This is defined as follows: For F an induced subgraph of G, the F-connectivity of G is the minimum number of vertices whose removal produces the trivial graph or a disconnected graph, each of whose components is a subgraph of F. The F-edge-connectivity of G is defined similarly. Bounds on the F-connectivity of a graph are investigated and a Whitney-type inequality relating F-connectivity and F- edge-connectivity of a graph is established. Reviewer: R.E.L.Aldred MSC: 05C40 Connectivity Keywords:conditional connectivity; F-connectivity PDFBibTeX XMLCite \textit{P. J. Malde} and \textit{O. R. Oellermann}, Sci., Ser. A 1, 65--71 (1988; Zbl 0687.05030)