10 citations · 74 across the 27 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 1 cited
A characterization of graphs with regular distance- graphs
Elisabeth Gaar, Daniel Krenn
For non-negative integers~, we consider graphs in which every vertex has exactly vertices at distance~, i.e., graphs whose distance- graphs are -regular. We call su…
cs.FL2020★ 2 cited
Decidability and k-Regular Sequences
Daniel Krenn, Jeffrey Shallit
In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from - lower and upper bounds on growth rate; in particular…
math.CO2020★ 2 cited
Towards a Computational Proof of Vizing's Conjecture using Semidefinite Programming and Sums-of-Squares
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the product of the domination numbers of two graphs to the domination number of their Cartesian product graph. In this paper, we formu…