Geoffrey Boyer

collaborators

3 papers

math.CO2025

All- $k$ -Isolation in Trees

Geoffrey Boyer, Garrett C. Farrell, Wayne Goddard

We define an all- $k$ -isolating set of a graph to be a set $S$ of vertices such that, if one removes $S$ and all its neighbors, then no component in what remains has order $k$ or mo…

math.CO2025

Well-hued graphs with first difference two

Geoffrey Boyer, Kirsti Kuenzel, Jeremy Lyle +1

A graph $G$ is said to be well-hued if every maximal $k$ -colorable subgraph of $G$ has the same order $a_{k}$ . Therefore, if $G$ is well-hued, we can associate with $G$ a sequence $\…

math.CO2025

Bounds on Independent Isolation in Graphs

Geoffrey Boyer, Wayne Goddard

An isolating set of a graph is a set of vertices $S$ such that, if $S$ and its neighborhood is removed, only isolated vertices remain; and the isolation number is the minimum size…

All-k-Isolation in Trees

Well-hued graphs with first difference two

Bounds on Independent Isolation in Graphs

All- $k$ -Isolation in Trees