scientific article; zbMATH DE number 4112657

From MaRDI portal
Publication:3835504





The author defines the isolation of a graph G, \[ isol(G)=\max \{| S| /i(G-S);\quad S\subseteq V(G),\quad i(G-S)>0\}, \] where i(G-S) is the number of isolated vertices of G-S. The isolation of some classes of graphs are determined, and bounds are given in terms of maximum and minimum degrees, stable number, or connectivity. By a theorem of Las Vergnas, it is also shown that a graph G has (1,n)-factor if isol(G)\(\geq 1/n\), when \(n\geq 2\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835504)