Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs

Bostjan Bresar, Tanja Dravec, Daniel P. Johnston +3

The isolation number ${\hat{I}}^1(G)$ of a graph $G$ is the minimum cardinality of a set $A\subset V(G)$ such that the subgraph induced by the vertices that are not in the union of the clos…