Dayle Scicluna

collaborators

3 papers

math.CO2025

Isolation of non-triangle cycles in graphs

Peter Borg, Dayle Scicluna

Given a set $F$ of graphs, we call a copy of a graph in $F$ an $F$ -graph. The $F$ -isolation number of a graph $G$ , denoted by $ι(G, \mathcal…

math.CO2025

Solution to a problem on isolation of $3$ -vertex paths

Karl Bartolo, Peter Borg, Dayle Scicluna

The $3$ -path isolation number of a connected $n$ -vertex graph $G$ , denoted by $ι (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbo…

math.CO2025

Solution to a $3$ -path isolation problem for subcubic graphs

Karl Bartolo, Peter Borg, Dayle Scicluna

The $3$ -path isolation number of a connected $n$ -vertex graph $G$ , denoted by $ι (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbo…

Isolation of non-triangle cycles in graphs

Solution to a problem on isolation of 3-vertex paths

Solution to a 3-path isolation problem for subcubic graphs

Solution to a problem on isolation of $3$ -vertex paths

Solution to a $3$ -path isolation problem for subcubic graphs