The purpose of this survey is to bring some order into the growing literature on a type of
graphs which emerged in the past couple of decades under a wealth of names and in …

This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$ G $)
and the related area of zero forcing, propagation, and throttling. The IEP-$ G $ grew from the …

If G is a graph, then a sequence v 1,…, vm of vertices is a closed neighborhood sequence if
for all 2≤ i≤ m we have N [vi]⁄⊆∪ j= 1 i− 1 N [vj], and it is an open neighborhood sequence …

In this article, we focus on solving the power dominating set problem and its connected
version. These problems are frequently used for finding optimal placements of phasor …

Power domination in graphs arises from the problem of monitoring an electric power system
by placing as few measurement devices in the system as possible. A power dominating set …

Let G be a simple, undirected graph. Positive semidefinite (PSD) zero forcing on G is based
on the following color-change rule: Let W 1, W 2,…, W k be the sets of vertices of the k …

The recently introduced concept of k-power domination generalizes domination and power
domination, the latter concept being used for monitoring an electric power system. The k …

In this paper, we study the power domination problem in Knodel graphs W-Delta, W-2 nu
and Hanoi graphs Hp (n). We determine the power domination number of W-3, W-2 nu and …

In network theory, the domination parameter is vital in investigating several structural
features of the networks, including connectedness, their tendency to form clusters …

In this paper, we continue the study of power domination in graphs (see TW Haynes et al.,
SIAM J. Discrete Math., 15 (2002), pp. 519--529; P. Dorbec et al., SIAM J. Discrete Math., 22 …