English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S . A dominating set S of G is said to be a perfect dominating set if each vertex in V − S is adjacent to exactly one vertex in S. The minimum cardinality of a perfect dominating set is the perfect domination number γ p ( G ) . A function f : V ( G ) → { 0 , 1 , 2 } is a perfect Roman dominating function (PRDF) on G if every vertex u ∈ V for which f ( u ) = 0 is adjacent to exactly one vertex v for which f ( v ) = 2 . The weight of a PRDF is the sum of its function values over all vertices, and the minimum weight of a PRDF of G is the perfect Roman domination number γ R p ( G ) . In this paper, we prove that for any nontrivial tree T, γ R p ( T ) ≥ γ p ( T ) + 1 and we characterize all trees attaining this bound.

On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree