Gabby Fischberg

most citedPaired

(n - 1)

-to-

(n - 1)

disjoint path covers in bipartite transposition-like graphs

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

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.CO2024★ 1 cited

Paired $(n - 1)$ -to- $(n - 1)$ disjoint path covers in bipartite transposition-like graphs

Anna Coleman, Gabrielle Fischberg, Charles Gong +2

A paired $k$ -to- $k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_{1}, P_{2}, \dots, P_{k}$ such that each $P_{i}$ has prescribed vertices $s_{i}$ a…

The k-Total Bondage Number of a Graph

Paired (n−1)-to-(n−1) disjoint path covers in bipartite transposition-like graphs

The $k$ -Total Bondage Number of a Graph

Paired $(n - 1)$ -to- $(n - 1)$ disjoint path covers in bipartite transposition-like graphs