Dayle Scicluna

activity

20242026

3

-path isolation problem for subcubic graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

4 papers

math.CO2026★ 1 cited

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 $I^^{1} (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighb…

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, \mathca…

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 $I^^{1} (G, P_{3})$ , is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighb…

math.CO2024

Isolation of squares in graphs

Karl Bartolo, 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…

Solution to a 3-path isolation problem for subcubic graphs

Isolation of non-triangle cycles in graphs

Solution to a problem on isolation of 3-vertex paths

Isolation of squares in graphs

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

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