RECENT RESULTS ON THE POWER DOMINATION NUMBERS OF GRAPH PRODUCTS

Sokos Hotel Albert Sokos Hotel Aleksanteri Sokos Hotel Helsinki Sokos Hotel Presidentti Sokos Hotel Pasila Sokos Hotel Torni Sokos Hotel

(“Power domination in product graphs,” (2008)) (the power domination problem for the tensor product of two

In this paper we found an upper bound for the irredundant complete domination number and relationship between irredundant complete domination numbers of graphs

The power domination number of a simple graph G, denoted γ p (G) gives the minimum number of measurement devices known as phasor measurement units (PMUs) required to observe a

Both the domination and broadcast numbers of a tree can be determined in linear time (see [2] and [4], respectively), but knowing that γ(T ) = γ b (T ) for some tree T (or for

We generalize recent results by Zwierzchowski [Graph Theory Notes of New York, XLVI, NY Acad.. Domination in graphs is now well studied in

A set D of vertices of a connected graph G = (V; E) is called a connected k-dominating set of G if every vertex in V –D is within distance k from some vertex of D, and the