3 citations · 4 across the 19 of their papers we have counts for
6 papers · 1 filter
Graphs with equal Grundy domination and independence number
Gábor Bacsó, Boštjan Brešar, Kirsti Kuenzel +1
The Grundy domination number, , of a graph is the maximum length of a sequence of vertices in such that for every $i\in \{2,\ldots,…
Loop zero forcing and grundy domination in planar graphs and claw-free cubic graphs
Alex Domat, Kirsti Kuenzel
Given a simple, finite graph with vertex set , we define a zero forcing set of as follows. Choose and color all vertices of blue and all vertices in…
Orientable domination in product-like graphs
Sarah Anderson, Boštjan Brešar, Sandi Klavžar +2
The orientable domination number, , of a graph is the largest domination number over all orientations of . In this paper, is studied on different p…
Power domination in cubic graphs and Cartesian products
Sarah E. Anderson, Kirsti Kuenzel
The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power…
Graphs which satisfy a Vizing-like bound for power domination of Cartesian products
Sarah E. Anderson, Kirsti Kuenzel, Houston Schuerger
Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph , a su…
On independent domination in direct products
Kirsti Kuenzel, Douglas F. Rall
In \cite{nr-1996} Nowakowski and Rall listed a series of conjectures involving several different graph products. In particular, they conjectured that wh…