Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each vertex v ∈ V (G) \ V is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V ...

A well recognized pattern during even-aged stands development is the growth decline after reaching a peak. We studied the effect of changes in stand structure, characterized by growth dominance, upon stand growth, stand ...

The development of forests over time is influenced by competition for resources among trees, leading to patterns of size hierarchy. These two aspects – competition and size hierarchy – can be examined in conjunction with ...

A sequence of vertices in a graph G with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices ...

The minimum roman dominating problem (denoted by γR(G), the weight of minimum roman dominating function of graph G) is a variant of the very well known minimum dominating set problem (denoted by γ(G), the cardinality of ...