Author

T. Sanh

h-index 0 View on Semantic Scholar

We have 1 of 1 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

Nordhaus-Gaddum Inequalities for Dominating-Set Counts in Bipartite Graphs

A dominating set in a graph $G$ is a subset $S$ of its vertices such that each vertex in $G$ is either in $S$ or adjacent to a vertex in $S$. Nordhaus-Gaddum inequalities relate the values of a graph parameter on a graph and its complement. In this setting, Keough and Shane conjecture that any graph $G$ on $n$ vertices...

T. Sanh · 0 citations