4 papers
Isolation critical graphs under multiple edge subdivision
Karl Bartolo, Peter Borg, Magda Dettlaff +2
This paper introduces the notion of an -critical graph. The isolation number of a graph , denoted by and also known as the vertex-edge domination number of , is…
Solution to a problem on isolation of -vertex paths
Karl Bartolo, Peter Borg, Dayle Scicluna
The -path isolation number of a connected -vertex graph , denoted by , is the size of a smallest subset of the vertex set of such that the closed neighbo…
Solution to a -path isolation problem for subcubic graphs
Karl Bartolo, Peter Borg, Dayle Scicluna
The -path isolation number of a connected -vertex graph , denoted by , is the size of a smallest subset of the vertex set of such that the closed neighbo…
Isolation of squares in graphs
Karl Bartolo, Peter Borg, Dayle Scicluna
Given a set of graphs, we call a copy of a graph in an -graph. The -isolation number of a graph , denoted by $ι(G,\mathcal{…