Eliel Sosis

collaborators

2 papers

math.CO2025

The $k$ -Total Bondage Number of a Graph

Jean-Pierre Appel, Gabby Fischberg, Kyle Kelley +2

Let $G = (V, E)$ be a connected, finite undirected graph. A set $S \subseteq V$ is said to be a total dominating set of $G$ if every vertex in $V$ is adjacent to some vertex in $S$ . T…

math.NT2022

Winning Strategies for Generalized Zeckendorf Game

Steven J. Miller, Eliel Sosis, Jingkai Ye

Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result holds for other positive linear recurrence…

The k-Total Bondage Number of a Graph

Winning Strategies for Generalized Zeckendorf Game

The $k$ -Total Bondage Number of a Graph