K. Kelley

activity

20242026

collaborators

Showing math.COShow all

3 papers · 1 filter

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.CO2025

An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

Marco Aldi, Thor Gabrielsen, Daniele Grandini +2

We introduce a lower bound for the independence number of an arbitrary $k$ -uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.

math.CO2024

Properties of Sub-Add Move Graphs

Patrick Cesarz, Eugene Fiorini, Charles Gong +3

We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $Z$ -module $Z_{n}^{m}$ , and whose arc set is uniquely determined by the action…

The k-Total Bondage Number of a Graph

An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

Properties of Sub-Add Move Graphs

The $k$ -Total Bondage Number of a Graph