98 citations · 348 across the 30 of their papers we have counts for
4 papers · 1 filter
On exponential domination of the consecutive circulant graph
Michael Dairyko, Michael Young
For a graph we consider to be a porous exponential dominating set if for every $v \in…
The inverse eigenvalue problem of a graph: Multiplicities and minors
Wayne Barrett, Steve Butler, Shaun M. Fallat +5
The inverse eigenvalue problem of a given graph is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G…
Polychromatic Colorings on the Integers
Maria Axenovich, John Goldwasser, Bernard Lidický +4
We show that for any set , there exists a 3-coloring of in which every translate of receives all three colors. This implies that …
The relationship between -forcing and -power domination
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter +1
Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In b…