Next Article in Journal
Geometric Modeling of Novel Generalized Hybrid Trigonometric Bézier-Like Curve with Shape Parameters and Its Applications
Next Article in Special Issue
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
Previous Article in Journal
Skeletal Rearrangements of the C240 Fullerene: Efficient Topological Descriptors for Monitoring Stone–Wales Transformations
Previous Article in Special Issue
Secure Total Domination in Rooted Product Graphs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

1
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
2
LAMDA-RO Laboratory, Department of Mathematics, University of Blida, Blida B.P. 270, Algeria
3
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz 51368, Iran
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(6), 966; https://doi.org/10.3390/math8060966
Submission received: 23 April 2020 / Revised: 30 May 2020 / Accepted: 7 June 2020 / Published: 12 June 2020
(This article belongs to the Special Issue Distances and Domination in Graphs)

Abstract

:
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.

1. Introduction

In this paper, only simple and undirected graph without isolated vertices will be considered. The set of vertices of the graph G is denoted by V = V ( G ) and the edge set is E = E ( G ) . The order of a graph G is the number of vertices of the graph G and it is denoted by n = n ( G ) . The size of G is the cardinality of the edge set and it is denoted by m = m ( G ) . For a vertex v V , the open neighbourhood N ( v ) is the set { u V ( Γ ) : u v E ( G ) } , the closed neighbourhood of v is the set N [ v ] = N ( v ) { v } , and the degree of v is deg G ( u ) = | N ( v ) | . Any vertex of degree one is called a leaf, a support vertex is a vertex adjacent to a leaf, a strong support vertex is a support vertex adjacent to at least two leaves and an end support vertex is a support vertex such that all its neighbors, except possibly one, are leaves. For a graph G, let L ( G ) = { v V ( G ) deg G ( v ) = 1 } and L v = N ( v ) L ( G ) . The distance d G ( u , v ) between two vertices u and v in a connected graph G is the length of a shortest u v path in G . The diameter of G, denoted by diam ( G ) , is the maximum value among distances between all pair of vertices of G. For a vertex v in a rooted tree T, let C ( v ) and D ( v ) denote the set of children and descendants of v, respectively and let D [ v ] = D ( v ) { v } . Moreover, the depth of v, depth ( v ) , is the largest distance from v to a vertex in D ( v ) . The maximal subtree rooted at v, denoted by T v , consists of v and all its descendants. We write P n for the path of order n. A tree T is a double star if it contains exactly two vertices that are not leaves. A double star with, respectively p and q leaves attached at each support vertex is denoted D S p , q . For a real-valued function f : V R , the weight of f is w ( f ) = v V f ( v ) , and for S V we define f ( S ) = v S f ( v ) . So w ( f ) = f ( V ) .
A dominating set (DS) 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 (PDS) if each vertex in V S is adjacent to exactly one vertex in S. The minimum cardinality of a (perfect) dominating set of a graph G is the (perfect) domination number γ ( G ) ( γ p ( G ) ). Perfect domination was introduced by Livingston and Stout in [1] and has been studied by several authors [2,3,4,5,6].
A function f : V ( Γ ) { 0 , 1 , 2 } is a Roman dominating function (RDF) on G if every vertex u V for which f ( u ) = 0 is adjacent to at least one vertex v for which f ( v ) = 2 . A perfect Roman dominating function (PRDF) on a graph G is an RDF f such that every vertex assigned a 0 is adjacent to exactly one vertex assigned a 2 under f . The minimum weight of a (perfect) RDF on a graph G is the (perfect) Roman domination number γ R ( G ) ( γ R p ( G ) ). A (perfect) RDF on G with weight γ R ( G ) ( γ R p ( G ) ) is called a γ R ( G ) -function ( γ R p ( G ) -function). An RDF f on a graph G = ( V , E ) can be represented by the ordered partition ( V 0 , V 1 , V 2 ) of V, where V i = { v V | f ( v ) = i } for i = 0 , 1 , 2 . The concept of Roman domination was introduced by Cockayne et al. in [7] and was inspired by the manuscript of the authors of [8], and Stewart [9] about the defensive strategy of the Roman Empire decreed by Constantine I The Great, while perfect Roman domination was introduced by Henning, Klostermeyer and MacGillivray in [10] and has been studied in [11,12,13]. For more on Roman domination, we refer the reader to the book chapters [14,15] and surveys [16,17,18].
It was shown in [10] that for any tree G of order n 3 , γ R p ( G ) 4 n 5 . Moreover, the authors have characterized all trees attaining this upper bound. Note that the previous upper bound have been improved by Henning and Klostermeyer [13] for cubic graphs of order n by showing that γ R p ( G ) 3 n 4 .
It is worth mentioning that if S is a minimum (perfect) dominating set of a graph G, then clearly ( V S , , S ) is a (perfect) RDF and thus
γ R ( G ) 2 γ ( G ) and γ R p ( G ) 2 γ p ( G ) .
On the other hand, if f = ( V 0 , V 1 , V 2 ) is a γ R ( G ) -function, then V 1 V 2 is a dominating set of G yielding
γ ( G ) γ R ( G ) .
It is natural to ask whether the inequality (2) remains valid between γ P ( G ) and γ R p ( G ) for any graph G . The answer is negative as it can be seen by considering the graph H obtained from a double star D S p , p , ( p 3 ) with central vertices u , v by subdividing the edge u v with vertex w, and adding 2 k ( k 3 ) new vertices, where k vertices are attached to both u and w and the remaining k vertices are attached to both v and w (see Figure 1). Clearly, γ p ( H ) = 2 k + 3 while γ R p ( H ) = 5 and so the difference γ p ( H ) γ R p ( H ) can be even very large.
Motivated by the above example, we shall show in this paper that γ R p ( T ) γ p ( T ) + 1 for every nontrivial tree T, and we characterize all trees attaining this bound.

2. Preliminaries

We start by providing some useful definitions and observations throughout the paper.
Definition 1.
For any graph G, let
W G R , 1 = { u V t h e r e e x i s t s a γ R p ( G ) - f u n c t i o n f s u c h t h a t f ( u ) = 2 } , W G R , 1 = { u V f ( u ) 1 f o r s o m e γ R p ( G ) - f u n c t i o n f } , W G R , 1 = { u V f o r e a c h v N G ( u ) , f ( v ) 1 f o r e v e r y γ R p ( G ) - f u n c t i o n f } , W G P , A = { u V u belongs to every γ p ( G ) - set } .
Definition 2.
Let u be a vertex of a graph G. A set S is said to be an almost perfect dominating set (almost PDS) with respect to u , (i) if each vertex x V \ ( S { u } ) has exactly one neighbor in S , and (ii) if u V \ S , then u has at most one neighbor in S. Let
γ p ( G ; u ) = min { | S | : S is an almost PDS with respect to u } .
Trivially, every PDS of G is an almost PDS with respect to any vertex of G and thus γ p ( G ; u ) is well defined. Hence γ p ( G ; u ) γ p ( G ) for each vertex u V . Let
W G A P D = { u V γ p ( G ; u ) = γ p ( G ) } .
The proof of the following two results are given in [12].
Observation 1.
Let G be a graph.
1. 
Any strong support vertex belongs to W G P , A .
2. 
Any support vertex adjacent to a strong support vertex, belongs to W G P , A .
3. 
For any leaf u of G, there is a γ R p ( G ) -function f such that f ( u ) 1 .
Proposition 1.
Let G be a graph. G has a γ R p ( G ) -function that assigns 2 to every end strong support vertex. Thus every end strong support vertex of a graph G belongs to W G R , 1 .
The next result is a consequence of Observation 1 and Proposition 1.
Corollary 1.
Let u be an end strong support vertex of a graph H. If G is the graph obtained from H by adding a vertex x and an edge u x , then γ p ( G ) = γ p ( H ) and γ R p ( G ) = γ R p ( H ) .
Proposition 2.
Let H be a graph and u V ( H ) . If G is a graph obtained from H by adding a path P 2 : x 1 x 2 attached at u by an edge u x 1 , then:
1. 
γ p ( G ) γ p ( H ) + 1 and γ R p ( G ) γ R p ( H ) + 1 .
2. 
If u W H R , 1 W H R , 1 , then γ R p ( G ) = γ R p ( H ) + 1 .
3. 
If u W H A P D , then γ p ( G ) = γ p ( H ) + 1 .
Proof. 
  • For a γ p ( H ) -set S , let S = S { x 1 } if u S , and S = S { x 2 } if u S . Clearly, S is a PDS of G and thus γ p ( G ) γ p ( H ) + 1 .
    Now let f be a γ R p ( G ) -function. Obviously, f ( x 1 ) + f ( x 2 ) 1 . If f ( u ) 1 , then the function f restricted to H is a PRDF on H yielding γ R p ( G ) γ R p ( H ) + 1 . Thus assume that f ( u ) = 0 . Then f ( x 1 ) + f ( x 2 ) = 2 and the function g : V ( H ) { 0 , 1 , 2 } defined by g ( u ) = 1 and g ( x ) = f ( x ) for x V ( H ) \ { u } is a PRDF on H of weight γ R p ( G ) 1 . Hence in any case, γ R p ( G ) γ R p ( H ) + 1 .
  • Assume first that u W H R , 1 and let f be a γ R p ( H ) -function with f ( u ) = 2 . Then f can be extended to a PRDF of G by assigning a 1 to x 2 and a 0 to x 1 and thus γ R p ( G ) γ R p ( H ) + 1 . The equality follows by item 1 . Assume now that u W G R , 1 and let f be a γ R p ( H ) -function. By the definition of W H R , 1 , we must have f ( u ) 1 to Roman dominate u. Now, if f ( u ) = 2 , then using the same argument as above we obtain γ R p ( G ) = γ R p ( H ) + 1 . Hence assume that f ( u ) = 1 . Then the function g : V ( G ) { 0 , 1 , 2 } defined by g ( x 1 ) = 2 , g ( u ) = g ( x 2 ) = 0 and g ( x ) = f ( x ) for all x V ( H ) \ { u } is a PRDF of G of weight γ R p ( H ) + 1 . Therefore γ R p ( G ) γ R p ( H ) + 1 , and the equality follows by item 1.
  • Let S be a γ p ( G ) -set. Clearly, | S { x 1 , x 2 } | 1 and S { x 1 , x 2 } is an almost PDS of H with respect to u. Since u W H A P D , we have | S { x 1 , x 2 } | γ p ( G ; u ) = γ p ( H ) . Therefore γ p ( G ) = | S | γ p ( H ) + 1 , and the equality follows from item 1. □
For a graph G and a vertex u of G, we denote by G K 1 , 3 u the graph obtained from G by adding a star K 1 , 3 and joining one of its leaf to u.
Proposition 3.
Let G be a graph and u a vertex of G.
1. 
γ p ( G K 1 , 3 u ) γ p ( G ) + 2 and γ R p ( G ) + 2 γ R p ( G K 1 , 3 u ) .
2. 
If u W G P , A W G A P D , then γ p ( G K 1 , 3 u ) = γ p ( G ) + 2 .
3. 
If u W G R , 1 , then γ R p ( G K 1 , 3 u ) = γ R p ( G ) + 2 .
Proof. 
Let x be the center of the star K 1 , 3 and x 1 a leaf of K 1 , 3 attached at u by an edge u x 1 .
  • For a γ p ( G ) -set S , let S = S { x , x 1 } if u S , and S = S { x } for otherwise. Clearly, S is a PDS of G K 1 , 3 u and thus γ p ( G K 1 , 3 u ) γ p ( G ) + 2 .
    Now, let f be a γ R p ( G K 1 , 3 u ) -function. By Proposition 1, we may assume that f ( x ) = 2 . If f ( x 1 ) 1 , then the function f restricted to G is a PRDF on G of weight at most γ R p ( G K 1 , 3 u ) 2 . Thus, we assume that f ( x 1 ) = 2 . Then the function g : V ( G ) { 0 , 1 , 2 } defined by g ( u ) = 1 and g ( x ) = f ( x ) for all x V ( G ) \ { u } is a PRDF on G of weight γ R p ( G K 1 , 3 u ) 3 . In any case, γ R p ( G ) γ R p ( G K 1 , 3 u ) 2 .
  • Let S be a γ p ( G K 1 , 3 u ) -set. By Observation 1-(1), we have x S . Now, if u S , then x 1 S and clearly S { x , x 1 } is a PDS of G , implying that γ p ( G K 1 , 3 u ) γ p ( G ) + 2 . Thus, assume that u S . If x 1 S , then S { x } is a PDS of G that does not contain u and since u W G P , A we deduce that | S { x } | γ p ( G ) + 1 . Hence γ p ( G K 1 , 3 u ) γ p ( G ) + 2 . If x 1 S , then S { x , x 1 } is an almost PDS of G and since u W G A P D we conclude that | S { x , x 1 } | γ p ( G ) . Hence γ p ( G K 1 , 3 u ) γ p ( G ) + 2 . Whatever the case, the equality follows from item 1.
  • Assume that u W G R , 1 and let f be a γ R p ( G ) -function such that f ( u ) 1 . Then f can be extended to a PRDF on G K 1 , 3 u by assigning a 2 to x and a 0 to every neighbor of x and thus γ R p ( G K 1 , 3 u ) γ R p ( G ) + 2 . The equality follows from item 1. □
Proposition 4.
Let G be a graph and let u be an end support vertex of G which is adjacent to a strong support vertex v. If G is a graph obtained from G by adding a vertex x and an edge u x , then γ p ( G ) = γ p ( G ) and γ R p ( G ) γ R p ( G ) . Moreover, if u W G R , 1 , then γ R p ( G ) = γ R p ( G ) .
Proof. 
Let S be a γ p ( G ) -set. By Observation 1, v S . Thus u S for otherwise u would have two neighbors in S . Hence S is a PDS of G and so γ p ( G ) γ p ( G ) . On the other hand, by Observation 1, any γ p ( G ) -set contains both u and v , and thus remains a PDS of G . It follows that γ p ( G ) γ p ( G ) , and the desired equality is obtained.
Since u is an end strong support vertex in G , u W G R , 1 . By Proposition 1, there is a γ R p ( G ) -function f such that f ( u ) = 2 , and clearly f restricted to G is a PRDF on G yielding γ R p ( G ) γ R p ( G ) .
Now, assume that u W G R , 1 and let g be a γ R p ( G ) -function with g ( u ) = 2 . Then g can be extended to a PRDF on G by assigning a 0 to x . Thus γ R p ( G ) γ R p ( G ) , and the desired equality follows. □
Proposition 5.
Let G be a graph and u a vertex of G . If G is a graph obtained from G by adding a double star D S 2 , 2 attached at u by one of its leaves, then:
1. 
γ p ( G ) γ p ( G ) + 3 and γ R p ( G ) γ R p ( G ) + 3 .
2. 
If u W G R , 1 , then γ R p ( G ) = γ R p ( G ) + 3 .
3. 
If u W G P , A W G A P D , then γ p ( G ) = γ p ( G ) + 3 .
Proof. 
Let x , y be the non-leaf vertices of the double star D S 2 , 2 , and let L x = { x 1 , x 2 } and L y = { y 1 , y 2 } . We assume that x 1 u E ( G ) .
  • For a γ p ( G ) -set S , let S = S { x , y } if u S , and S = S { x 1 , x , y } if u S . Clearly, S is a PDS of G and thus γ p ( G ) γ p ( G ) + 3 .
    Consider now a γ R p ( G ) -function f such that f ( y ) = 2 (according to Proposition 1). Clearly, f ( x ) + f ( x 2 ) 1 . If f ( x 1 ) 1 , then f restricted to G is a PRDF on G of weight at most γ R p ( G ) 3 and thus γ R p ( G ) γ R p ( G ) + 3 . If f ( x 1 ) = 2 , then f ( u ) = 0 and the function g : V ( G ) { 0 , 1 , 2 } defined by g ( u ) = 1 and g ( w ) = f ( w ) otherwise, is a PRDF on G of weight at most γ R p ( G ) 4 yielding γ R p ( G ) γ R p ( G ) + 4 . In any case we have γ R p ( G ) γ R p ( G ) + 3 .
  • Assume that u W G R , 1 and let f be a γ R p ( G ) -function such that f ( u ) = 2 . Then f can be extended to a PRDF on G by assigning a 2 to y, a 1 to x 2 and a 0 to x , x 1 , y 1 , y 2 . Hence γ R p ( G ) γ R p ( G ) + 3 , and the desired equality follows from item 1.
  • Assume that u W G P , A W G A P D , and let S be a γ p ( G ) -set. By items 1 and 2 of Observation 1, x , y S . If u S , then x 1 S and thus S { x , y , x 1 } is a PDS of G , implying that γ p ( G ) γ p ( G ) + 3 . Hence, assume that u S . If x 1 S , then S { x , y } is a PDS of G that does not contain u. But since u W G 3 we deduce that | S { x , y } | γ p ( G ) + 1 which yields γ p ( G ) γ p ( G ) + 3 . Thus suppose that x 1 S . Then S { x , y , x 1 } is an almost PDS of G , and since u W G A P D we conclude that | S { x , y , x 1 } | γ p ( G ; u ) = γ p ( G ) . Hence γ p ( G ) γ p ( G ) + 3 , and the desired equality is obtained by item 1. □
Proposition 6.
Let G be a graph and let u be an end strong support vertex of degree 3 whose non-leaf neighbor is a support vertex, say v , of degree 3, where L v = 1 . Let G be a graph obtained from G by adding four vertices, where two are attached to a leaf of u and the other two are attached to the leaf of v. Then γ p ( G ) = γ p ( G ) + 2 and γ R p ( G ) = γ R p ( G ) + 2 .
Proof. 
Let L u = { x , x } and L v = { y } . Let x 1 , x 2 , y 1 and y 2 be the four added vertices, where x x 1 , x x 2 , y y 1 , y y 2 E ( G ) . By items 1 and 2 of Observation 1, any γ p ( G ) -set contains u and v . Clearly such a set can be extended to a PDS of G by adding x , y which yields γ p ( G ) γ p ( G ) + 2 . On the other hand, let D be a γ p ( G ) -set. Then by items 1 and 2 of Observation 1, we have x , u , y , v D , and thus D \ { x , y } is a PDS of G , implying that γ p ( G ) γ p ( G ) + 2 . Therefore γ p ( G ) = γ p ( G ) + 2 .
Next we shall show that γ R p ( G ) = γ R p ( G ) + 2 . First we show that γ R p ( G ) γ R p ( G ) + 2 . Since u is an end strong support vertex of G , let f be a γ R p ( G ) -function with f ( u ) = 2 (by Proposition 1) such that f ( v ) is as small as possible. If f ( v ) 1 , then f ( y ) = 1 , and thus the function g : V ( G ) { 0 , 1 , 2 } defined by g ( x ) = g ( y ) = 2 , g ( x ) = 1 , g ( u ) = g ( x 1 ) = g ( x 2 ) = g ( y 1 ) = g ( y 2 ) = 0 and g ( w ) = f ( w ) otherwise, is a PRDF on G . Hence γ R p ( G ) γ R p ( G ) + 2 . If f ( v ) = 2 , then by our choice of f , we have f ( z ) = 0 for any z N ( v ) \ { u } and thus the function h : V ( G ) { 0 , 1 , 2 } defined by h ( z ) = 1 for z N ( v ) { u , y } and h ( x ) = 1 , h ( x ) = h ( y ) = 2 , h ( u ) = h ( v ) = h ( x 1 ) = h ( x 2 ) = h ( y 1 ) = h ( y 2 ) = 0 and h ( w ) = f ( w ) otherwise, is a PRDF on G yielding γ R p ( G ) γ R p ( G ) + 2 . Hence γ R p ( G ) γ R p ( G ) + 2 . Now we show that γ R p ( G ) γ R p ( G ) + 2 . By Proposition, let g be a γ R p ( G ) -function such that g ( x ) = g ( y ) = 2 . It can be seen that g ( x ) = 1 . If f ( v ) = 0 , then the function h : V ( G ) { 0 , 1 , 2 } defined by h ( u ) = 2 , h ( y ) = 1 , h ( x ) = h ( x ) = 0 and h ( w ) = g ( w ) otherwise, is a PRDF on G of weight at most γ R p ( G ) 2 . If f ( v ) 1 , then the function h : V ( G ) { 0 , 1 , 2 } defined by h ( u ) = h ( v ) = 2 , h ( x ) = h ( x ) = h ( y ) = 0 and h ( w ) = g ( w ) otherwise, is a PRDF on G of weight at most γ R p ( G ) 2 . In any case, γ R p ( G ) γ R p ( G ) + 2 , and the equality follows. □

3. The Family T

In this section, we define the family T of unlabeled trees T that can be obtained from a sequence T 1 , T 2 , , T k ( k 1 ) of trees such that T 1 { P 2 , P 3 } and T = T k . If k 2 , then T i + 1 is obtained recursively from T i by one of the following operations.
Operation O 1 : If u V ( T i ) is an end strong support vertex, then O 1 adds a vertex x attached at u by an edge u x to obtain T i + 1 .
Operation O 2 : If u ( W T i R , 1 W T i R , 1 ) W T i A P D , then O 2 adds a path P 2 = x 1 x 2 attached at u by an edge u x 1 to obtain T i + 1 .
Operation O 3 : If u W T i R , 1 W T i P , A W T i A P D , then O 3 adds a star K 1 , 3 centered at x by attaching one of its leaves, say x 1 , to u to obtain T i + 1 .
Operation O 4 : If u W T i R , 1 is an end support vertex which is adjacent to a strong support vertex, then O 4 adds a vertex x attached at u by an edge u x to obtain T i + 1 .
Operation O 5 : If u W T i R , 1 W T i P , A W T i A P D , then O 5 adds a double star D S 2 , 2 by attaching one of its leaves, say x 1 , to u to obtain T i + 1 .
Operation O 6 : If u V ( T i ) is an end strong support vertex of degree 3 with x L u such that u is adjacent to a support vertex v of degree 3 with L v = { y } , then O 6 adds four vertices x 1 , x 2 , y 1 , y 2 attached at x and y by edges x x 1 , x x 2 , y y 1 , y y 2 to obtain T i + 1 .
Lemma 1.
If T i is a tree with γ R p ( T i ) = γ p ( T i ) + 1 and T i + 1 is a tree obtained from T i by one of the Operations O 1 , , O 6 , then γ R p ( T i + 1 ) = γ p ( T i + 1 ) + 1 .
Proof. 
If T i + 1 is obtained from T i by Operation O 1 , then by Corollary 1 and the assumption γ R p ( T i ) = γ p ( T i ) + 1 , we have γ R p ( T i + 1 ) = γ R p ( T i ) = γ p ( T i ) + 1 = γ p ( T i + 1 ) + 1 . If T i + 1 is obtained from T i by Operation O 2 , then as above the result follows from Proposition 2 (items 2, 3 and 4). If T i + 1 is obtained from T i by Operation O 3 , then the result follows from Proposition 3 (items 2 and 3). If T i + 1 is obtained from T i by Operation O 4 , then the result follows from Proposition 4. If T i + 1 is obtained from T i by Operation O 5 , then the result follows from Proposition 5. Finally, if T i + 1 is obtained from T i by Operation O 6 , then the result follows from Proposition 6. □
In the rest of the paper, we shall prove our main result:
Theorem 1.
For any tree T of order n 2 ,
γ R p ( T ) γ p ( T ) + 1 ,
with equality if and only if T T .

4. Proof of Theorem 1

Lemma 2.
If T T , then γ R p ( T ) = γ p ( T ) + 1 .
Proof. 
Let T be a tree of T . Then there exists a sequence of trees T 1 , T 2 , , T k ( k 1 ) such that T 1 { P 2 , P 3 } , and if k 2 , then T i + 1 can be obtained from T i by one of the aforementioned operations. We proceed by induction on the number of operations used to construct T. If k = 1 , then T { P 2 , P 3 } and clearly γ R p ( T ) = γ p ( T ) + 1 . This establishes our basis case. Let k 2 and assume that the result holds for each tree T T which can be obtained from a sequence of operations of length k 1 and let T = T k 1 . By the induction hypothesis, γ R p ( T ) = γ p ( T ) + 1 . Since T = T k is obtained from T by one of the Operations O i ( i { 1 , 2 , , 6 } ), we conclude from Lemma 1 that γ R p ( T ) = γ p ( T ) + 1 . □
Theorem 2.
For any tree T of order n 2 ,
γ R p ( T ) γ p ( T ) + 1 ,
with equality only if T T .
Proof. 
We use an induction on n. If n { 2 , 3 } , then T { P 2 , P 3 } , where γ R p ( T ) = 2 = γ p ( T ) + 1 and T T . If n = 4 and diam ( T ) = 2 , then T = K 1 , 3 , where γ R p ( T ) = 2 = γ p ( T ) + 1 and T T because it can be obtained from P 3 by applying Operation O 1 . If n = 4 and diam ( T ) = 3 , then T = P 4 , where γ R p ( T ) = 3 = γ p ( T ) + 1 and clearly T T since it can be obtained from P 2 by Operation O 2 . Let n 5 and assume that every tree T of order n with 2 n < n satisfies γ R p ( T ) γ p ( T ) + 1 with equality only if T T .
Let T be a tree of order n . If diam ( T ) = 2 , then T is a star, where γ R p ( T ) = 2 = γ p ( T ) + 1 and T T because T it can be obtained from P 3 by frequently use of Operation O 1 . Hence assume that diam ( T ) = 3 , and thus T is a double star D S p , q , ( q p 1 ) . If T = D S 1 , q ( q 2 ) , then γ R p ( T ) = 3 = γ p ( T ) + 1 and T T since it is obtained from P 3 by applying Operation O 2 . If T = D S p , q , ( q p 2 ) , then γ p ( T ) = 2 , γ R p ( T ) = 4 and so γ R p ( T ) > γ p ( T ) + 1 . Henceforth, we assume that diam ( T ) 4 . Let v 1 v 2 v k ( k 5 ) be a diametrical path in T such that deg T ( v 2 ) is as large as possible. Root T at v k and consider the following cases.
Case 1. deg T ( v 2 ) 4 .
Let T = T v 1 . By Corollary 1 and the induction hypothesis on T , we obtain
γ R p ( T ) = γ R p ( T ) γ p ( T ) + 1 = γ p ( T ) + 1 .
Further if γ R p ( T ) = γ p ( T ) + 1 , then we have equality throughout this inequality chain. In particular, γ R p ( T ) = γ p ( T ) + 1 . By induction on T , we have T T . It follows that T T since it can be obtained from T by applying operation O 1 .
Case 2. deg T ( v 2 ) = deg T ( v 3 ) = 2 .
Let T = T T v 3 . For a γ p ( T ) -set S , let S = S { v 1 } if v 4 S and S = S { v 2 } for otherwise. Clearly S is a PDS of T and thus γ p ( T ) γ p ( T ) + 1 . Consider now a γ R p ( T ) -function f. If f ( v 3 ) { 0 , 1 } , then f ( v 1 ) + f ( v 2 ) = 2 and the function f, restricted to T is a PRDF on T of weight at most γ R p ( T ) 2 . If f ( v 3 ) = 2 , then f ( v 4 ) = 0 and the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 4 ) = 1 and g ( z ) = f ( z ) otherwise, is a PRDF on T . In any case, γ R p ( T ) γ R p ( T ) + 2 . By the induction hypothesis on T , we obtain
γ R p ( T ) γ R p ( T ) + 2 γ p ( T ) + 1 + 2 γ p ( T ) 1 + 3 > γ p ( T ) + 1 .
Case 3. deg T ( v 2 ) = 2 and deg T ( v 3 ) 3 .
Let T = T T v 2 . By Proposition 2, we have γ p ( T ) γ p ( T ) + 1 and γ R p ( T ) γ R p ( T ) + 1 . It follows from the induction hypothesis that
γ R p ( T ) γ R p ( T ) + 1 γ p ( T ) + 1 + 1 γ p ( T ) + 1 .
Further if γ R p ( T ) = γ p ( T ) + 1 , then we have equality throughout this inequality chain. In particular, γ p ( T ) = γ p ( T ) + 1 , γ R p ( T ) = γ R p ( T ) + 1 and γ R p ( T ) = γ p ( T ) + 1 . By induction on T , we deduce that T T . Next, we shall show that v 3 ( W T R , 1 W T R , 1 ) W T A P D . Let f be a γ R p ( T ) -function. If f ( v 3 ) = 2 , then f ( v 1 ) = 1 and f ( v 2 ) = 0 and the function f | V ( T ) is a γ R p ( T ) -function with f ( v 3 ) = 2 and hence v 3 W T R , 1 . Hence, assume that f ( v 3 ) 1 . Then f ( v 1 ) + f ( v 2 ) = 2 . If f ( v 2 ) 1 or f ( v 2 ) = 2 and f ( v 3 ) = 1 , then the function f restricted to T is a PRDF on T of weight γ R p ( T ) 2 , contradicting the fact γ R p ( T ) = γ R p ( T ) + 1 . Hence we assume f ( v 2 ) = 2 and f ( v 3 ) = 0 . Then the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 3 ) = 1 and g ( x ) = f ( x ) otherwise, is a γ R p ( T ) -function and so v 3 W T R , 1 . Hence v 3 W T R , 1 W T R , 1 . It remains to show that v 3 W T A P D . Suppose that v 3 W T 5 and let S be an almost PDS of T of size less that γ p ( T ) . Clearly, v 3 S and v 3 has no neighbor in S. Therefore, S { v 2 } is a PDS of T of size at most γ p ( T ) = γ p ( T ) 1 , a contradiction. Hence v 3 W T A P D . It follows that T T since it can be obtained from T by Operation O 2 .
Case 4. deg T ( v 2 ) = 3 .
Let L v 2 = { v 1 , w } . According to Cases 1, 2 and 3, we may assume that any end support vertex on a diametrical path has degree 3. Consider the following subcases.
Subcase 4.1. deg T ( v 3 ) = 2 .
Let T = T T v 3 . By Proposition 3-(1) and the induction hypothesis we have:
γ R p ( T ) γ R p ( T ) + 2 γ p ( T ) + 1 + 2 γ p ( T ) + 1 .
Further if γ R p ( T ) = γ p ( T ) + 1 , then we have equality throughout this inequality chain. In particular, γ R p ( T ) = γ R p ( T ) + 2 , γ p ( T ) = γ p ( T ) + 2 and γ R p ( T ) = γ p ( T ) + 1 . It follows from the induction hypothesis that T T . In the next, we shall show that v 4 W T R , 1 W T P , A W T A P D .
Suppose that v 4 W T P , A and let S be a γ p ( T ) -set that does not contain v 4 . Then S { v 2 } is a PDS of T, contradicting the fact γ p ( T ) = γ p ( T ) + 2 . Hence v 4 W T P , A . Suppose now that v 4 W T A P D and let D be an almost PDS of T with respect to v 4 such that D < γ p ( T ) . Then v 4 D and v 4 has no neighbor in D, and thus D { v 2 , v 3 } is a PDS of T of cardinality less γ p ( T ) + 2 , a contradiction. Hence v 4 W T A P D . It remains to show that v 4 W T R , 1 . By Proposition 1, let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 . If f ( v 4 ) = 2 , then we must have f ( v 3 ) 1 . But f restricted to T is a PRDF on T of weight at most γ R p ( T ) 3 , contradicting γ R p ( T ) = γ R p ( T ) + 2 . Hence f ( v 4 ) 1 . If f ( v 4 ) = 0 and f ( v 3 ) = 2 , then the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 4 ) = 1 and g ( x ) = f ( x ) otherwise, is a PRDF of T of weight at most γ R p ( T ) 3 , a contradiction as above. Thus f ( v 4 ) = 1 or f ( v 4 ) = 0 and f ( v 3 ) 1 . Then f restricted to T is a γ R p ( T ) -function showing that v 4 W T R , 1 . Hence v 4 W T R , 1 W T P , A W T A P D . Therefore, T T because it can be obtained from T by Operation O 3 .
Subcase 4.2. deg T ( v 3 ) 3 .
We distinguish between some situations.
(a) 
v 3 is a strong support vertex.
Let T = T v 1 . By Proposition 4 and the induction hypothesis we have:
γ R p ( T ) γ R p ( T ) γ p ( T ) + 1 = γ p ( T ) + 1 .
Further if γ R p ( T ) = γ p ( T ) + 1 , then we have equality throughout this inequality chain. In particular, γ R p ( T ) = γ R p ( T ) , γ p ( T ) = γ p ( T ) and γ R p ( T ) = γ p ( T ) + 1 . By the induction hypothesis, T T . To show v 2 W T R , 1 , let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 (by Proposition 1). Since γ R p ( T ) = γ R p ( T ) , f is also a γ R p ( T ) -function with f ( v 2 ) = 2 , implying that v 2 W T R , 1 . Therefore T T because it can be obtained from T by Operation O 4 .
(b) 
v 3 has two children x , y with depth one, different from v 2 .
Then u and w are both strong support vertices of degree 3. Let T = T T v 2 . By Observation 1, any γ p ( T ) -set S contains x and y and thus v 3 S . Hence S { v 2 } is a PDS of T yielding γ p ( T ) γ p ( T ) + 1 . Now, let f be a γ R p ( T ) function such that f ( v 2 ) = 2 and f ( x ) = 2 (by Proposition 1). Then f ( v 3 ) 1 . It follows that the function f restricted to T is a PRDF on T of weight γ R p ( T ) 2 , and hence γ R p ( T ) γ R p ( T ) + 2 . By the induction hypothesis we have
γ R p ( T ) γ R p ( T ) + 2 γ p ( T ) + 3 γ p ( T ) + 2 > γ p ( T ) + 1 .
(c) 
v 3 is a support vertex and has a child u with depth one different from v 2 .
Let w 1 be the unique leaf adjacent to v 3 . Note that u is a strong support vertices of degree 3. Let T = T T v 2 . If S is a γ p ( T ) -set, then by Observation 1-(2), v 3 S and thus S { v 2 } is a PDS of T yielding γ p ( T ) γ p ( T ) + 1 . By Proposition 1, let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 and f ( u ) = 2 . By the definition of perfect Roman dominating functions, we have f ( v 3 ) 1 . Then, the function f restricted to T is a PRDF on T of weight γ R p ( T ) 2 and thus γ R p ( T ) γ R p ( T ) + 2 . It follows from the induction hypothesis that
γ R p ( T ) γ R p ( T ) + 2 γ p ( T ) + 3 γ p ( T ) + 2 > γ p ( T ) + 1 .
According to (a), (b) and (c), we can assume for the next that deg T ( v 3 ) = 3 .
(d) 
deg T ( v 3 ) = 3 and v 3 has a child x with depth one different from v 2 .
Note that x is a strong support vertices of degree 3. Let L x = { x 1 , x 2 } and let T be the tree obtained from T by removing the set of vertices { v 1 , v 2 , w , x , x 1 , x 2 } . For a γ p ( T ) -set S , let S = S { v 2 , x } if v 3 S and S = S { v 2 , v 3 , x } when v 3 S . Clearly, S is a PDS of T and so γ p ( T ) γ p ( T ) + 3 . Now let f be a γ R p ( T ) -function such that f ( v 2 ) = f ( x ) = 2 . Then f ( v 3 ) 1 and the function f restricted to T is a PRDF on T of weight at most γ R p ( T ) 4 . By the induction hypothesis we have:
γ R p ( T ) γ R p ( T ) + 4 γ p ( T ) + 1 + 4 γ p ( T ) 3 + 5 > γ p ( T ) + 1 .
(e) 
deg T ( v 3 ) = 3 and v 3 is adjacent to exactly one leaf w .
If v 4 has a child s with depth one and degree two, then let T be the tree obtained from T by removing s and its unique leaf. This case can be treated in the same way as in Case 3. Moreover, if v 4 has a child s with depth one and degree at least four, then let T be the tree obtained from T by removing a leaf neighbor of s . This case can be treated in the same way as in Case 1. Hence, we may assume that each child of v 4 is a leaf or a vertex with depth one and degree 3 or a vertex with depth two whose maximal subtree is isomorphic to T v 3 . First assume that deg T ( v 4 ) 4 , and let T = T T v 3 . Clearly, any γ p ( T ) -set contains v 4 and such a set can be extended to a PDS of T by adding v 2 , v 3 . Hence γ p ( T ) γ p ( T ) + 2 . Now let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 . Clearly, f ( v 3 ) + f ( w ) 1 . If f ( v 3 ) 1 or f ( v 3 ) = 2 and f ( v 4 ) 1 , then the function f restricted to T is a PRDF on T and thus γ R p ( T ) γ R p ( T ) + 3 . Hence assume that f ( v 3 ) = 2 and f ( v 4 ) = 0 . Then the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 4 ) = 1 and g ( u ) = f ( u ) otherwise, is a PRDF of T of weight γ R p ( T ) 3 and thus γ R p ( T ) γ R p ( T ) + 3 . By the induction hypothesis we have:
γ R p ( T ) γ R p ( T ) + 3 γ p ( T ) + 1 + 3 γ p ( T ) 2 + 4 > γ p ( T ) + 1 .
From now on, we can assume that deg T ( v 4 ) 3 . We examine different cases.
(e.1.)
v 4 has a child x of degree 3 and depth 1.
Let L x = { z 1 , z 2 } and let T be the tree obtained from T by removing the set { v 1 , w , z 1 , z 2 } . By Proposition 6, we have γ p ( T ) = γ p ( T ) + 2 and γ R p ( T ) = γ R p ( T ) + 2 . We deduce from the induction hypothesis that
γ R p ( T ) = γ R p ( T ) + 2 γ p ( T ) + 1 + 2 = γ p ( T ) 2 + 3 = γ p ( T ) + 1 .
Further if γ R p ( T ) = γ p ( T ) + 1 , then we have equality throughout this inequality chain. In particular, γ R p ( T ) = γ p ( T ) + 1 . By induction on T , we have T T . Therefore T T since it can be obtained from T by Operation O 6 .
(e.2.)
v 4 has a child v 3 with depth two.
Note that T v 3 and T v 3 are isomorphic. Let T = T ( T v 3 T v 3 ) , and observe that v 4 is a leaf in T . Since any γ p ( T ) -set can be extended to a PDS of T by adding v 4 and the support vertices of T v 3 T v 3 we obtain γ p ( T ) γ p ( T ) + 5 . Moreover, as above we can see that γ R p ( T ) γ R p ( T ) + 6 . Now, by induction hypothesis we obtain:
γ R p ( T ) γ R p ( T ) + 6 γ p ( T ) + 1 + 6 γ p ( T ) 5 + 7 > γ p ( T ) + 1 .
(e.3.)
deg T ( v 4 ) = 2 .
Let T = T T v 4 . If V ( T ) = { v 5 } , then it can be seen that T is tree with γ R p ( T ) = 5 and γ p ( T ) = 3 , implying that γ R p ( T ) > γ p ( T ) + 1 . Hence we assume that T is nontrivial. By Proposition 5 and by the inductive hypothesis we have:
γ R p ( T ) γ R p ( T ) + 3 γ p ( T ) + 1 + 3 γ p ( T ) 3 + 4 = γ p ( T ) + 1 .
Further if γ R p ( T ) = γ p ( T ) + 1 , then we have equality throughout this inequality chain. In particular, γ R p ( T ) = γ R p ( T ) + 3 , γ p ( T ) = γ p ( T ) + 3 and γ R p ( T ) = γ p ( T ) + 1 . By induction on T , we have T T . Next, we shall show that v 5 W T R , 1 W T P , A W T A P D . Suppose that v 5 W T P , A and let S be a γ p ( T ) -set that does not contain v 5 . Then S { v 2 , v 3 } is a PDS of T contradicting γ p ( T ) = γ p ( T ) + 3 . Hence v 5 W T P , A . Suppose that v 5 W T A P D and let S be an almost PDS of T such that S γ p ( T ) 1 . Clearly, v 5 S and v 5 has no neighbor in S. It follows that S { v 4 , v 3 , v 2 } is a PDS of T of size S + 3 γ p ( T ) 1 , a contradiction. Thus v 5 W T A P D . Next we show that v 5 W T R , 1 . Let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 . To Roman dominate w , we must have either f ( w ) = 1 or f ( v 3 ) = 2 . We claim that f ( v 4 ) 1 . Suppose, to the contrary, that f ( v 4 ) = 2 . By definition of perfect Roman dominating functions, we may assume that f ( v 3 ) = 2 . But then the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 5 ) = 1 and g ( x ) = f ( x ) otherwise, is a PRDF of T of weight γ R p ( T ) 5 contradicting γ R p ( T ) = γ R p ( T ) + 3 . Hence f ( v 4 ) 1 . It follows that the function f restricted to T is a PRDF of T of weight at most γ R p ( T ) 3 for which we conclude from γ R p ( T ) = γ R p ( T ) + 3 that f ( v 3 ) = f ( v 4 ) = 0 and f ( w ) = 1 . Hence to Roman dominate v 4 , we must have f ( v 5 ) = 2 and thus function f restricted to T is a γ R p ( T ) -function that assigns a a 2 to v 5 . Hence v 5 W T R , 1 , and thus v 5 W T R , 1 W T P , A W T A P D . Therefore, T T since it can be obtained from T by Operation O 5 .
(e.4.)
deg T ( v 4 ) = 3 and v 4 has a child z with depth 0.
Seeing the above Cases and Subcases as we did in the beginning of Case (e), we may assume that any child of v 5 is a leaf, or an end strong support vertex of degree 3, or a vertex with depth 2 whose maximal subtree is isomorphic to T v 3 , or a vertex with depth 3 whose maximal subtree is isomorphic to T v 4 . Assume first that deg T ( v 5 ) 4 , and let T = T T v 4 . Clearly, v 5 belongs to any γ p ( T ) -set and such a set γ p ( T ) -set can be extended to a PDS of T by adding v 2 , v 3 , v 4 , implying that γ p ( T ) γ p ( T ) + 3 . Next we show that γ R p ( T ) γ R p ( T ) + 4 . Let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 . Clearly f ( v 3 ) + f ( w ) 1 and f ( v 4 ) + f ( z ) 1 . If f ( v 4 ) 1 or f ( v 5 ) 1 , then the function f restricted to T is a PRDF on T yielding γ R p ( T ) γ R p ( T ) + 4 . Hence assume that f ( v 4 ) = 2 and f ( v 5 ) = 0 . Then the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 5 ) = 1 and g ( u ) = f ( u ) otherwise, is a PRDF of T yielding γ R p ( T ) γ R p ( T ) + 4 . By induction on T , it follows that
γ R p ( T ) γ R p ( T ) + 4 γ p ( T ) + 5 γ p ( T ) + 2 > γ p ( T ) + 1 .
For the next, we assume that deg T ( v 5 ) 3 . If deg T ( v 5 ) = 1 , then it can be seen that T is a tree with γ R p ( T ) = 6 , γ p ( T ) and so γ R p ( T ) > γ p ( T ) + 1 . Hence we assume that deg T ( v 5 ) { 2 , 3 } . Consider the following situations.
(e.4.1.)
deg T ( v 5 ) = 2 .
Let T = T T v 5 . If V ( T ) = { v 6 } , then T is a tree with γ R p ( T ) = 6 and γ p ( T ) = 4 , yielding γ R p ( T ) > γ p ( T ) + 1 . Hence, assume that T is nontrivial. For a γ p ( T ) -set S, let S = S { v 2 , v 3 , v 4 , v 5 } if v 6 S , and S = S { v 2 , v 3 , v 4 } if v 6 S . Then S is a PDS of T , implying that γ p ( T ) γ p ( T ) + 4 . Moreover, it is easy to see that γ R p ( T ) γ R p ( T ) + 5 . By induction on T , we obtain γ R p ( T ) > γ p ( T ) + 1 .
(e.4.3.)
deg T ( v 5 ) = 3 and v 5 has a child v 4 with depth 3.
Then T v 4 and T v 4 are isomorphic. If u is a vertex in T v 4 , then let u be the vertex of T v 4 corresponding to u in T v 4 . Let T = T ( T v 4 T v 4 ) . Clearly, any γ p ( T ) -set can be extended to a PDS of T by adding v 5 , v 2 , v 3 , v 4 , v 2 , v 3 , v 4 and thus γ p ( T ) γ p ( T ) + 7 . Moreover, it is not hard to see that γ R p ( T ) γ R p ( T ) + 8 . By induction on T , we obtain γ R p ( T ) > γ p ( T ) + 1 .
(e.4.4.)
deg T ( v 5 ) = 3 and v 5 has a children y with depth 1 and degree 3.
Let T = T ( T v 4 T y ) . Clearly, any γ p ( T ) -set can be extended to a PDS of T by adding v 5 , v 2 , v 3 , v 4 , y and thus γ p ( T ) γ p ( T ) + 5 . Next, we show that γ R p ( T ) γ R p ( T ) + 6 . Let f be a γ R p ( T ) -function such that f ( v 2 ) = 2 and f ( y ) = 2 (by Proposition 1). Clearly f ( v 3 ) + f ( w ) 1 and f ( v 4 ) + f ( z ) 1 . If f ( v 5 ) 1 , then the function f restricted to T is a PRDF on T yielding γ R p ( T ) γ R p ( T ) + 6 . Thus, let f ( v 5 ) = 0 . Then to Roman dominate z , v 4 , w , we must have f ( z ) + f ( v 4 ) + f ( v 3 ) + f ( w ) 4 . Then the function g : V ( T ) { 0 , 1 , 2 } defined by g ( v 5 ) = 1 and g ( u ) = f ( u ) otherwise, is a PRDF on T yielding γ R p ( T ) γ R p ( T ) + 6 . It follows from the induction hypothesis that
γ R p ( T ) γ R p ( T ) + 6 γ p ( T ) + 7 γ p ( T ) + 2 > γ p ( T ) + 1 .
(e.4.5.)
deg T ( v 5 ) = 3 and v 5 has a child v 3 with depth 2 such that T v 3 T v 3 .
If u is a vertex in T v 3 , then let u be the vertex of T v 3 corresponding to u in T v 3 . Let T = T ( T v 4 T v 3 ) . Clearly, any γ p ( T ) -set can be extended to a PDS of T by adding v 5 , v 2 , v 3 , v 4 , v 2 , v 3 and so γ p ( T ) γ p ( T ) + 6 . Moreover, it is not hard to see that γ R p ( T ) γ R p ( T ) + 7 . By the induction hypothesis we obtain γ R p ( T ) > γ p ( T ) + 1 .
(e.4.6.)
deg T ( v 5 ) = 3 and v 5 has a children z with depth 0.
If V ( T ) = { v 6 } , then T is a tree with γ R p ( T ) = 6 and γ p ( T ) = 4 , yielding γ R p ( T ) > γ p ( T ) + 1 . Hence we assume that deg T ( v 6 ) 2 . Suppose first that deg T ( v 6 ) = 2 and let T = T T v 6 . If V ( T ) = { v 7 } , then T is a tree with γ R p ( T ) 7 and γ p ( T ) = 5 , yielding γ R p ( T ) > γ p ( T ) + 1 . Hence assume that T is nontrivial. Clearly, any γ p ( T ) -set can be extended to a PDS of T by adding v 2 , v 3 , v 4 , v 5 , v 6 and thus γ p ( T ) γ p ( T ) + 5 . On the other hand, it is not hard to see that γ R p ( T ) γ R p ( T ) + 7 . By the induction hypothesis we obtain γ R p ( T ) > γ p ( T ) + 1 .
Assume now that deg T ( v 6 ) 3 . By above Cases and Subcases, we may assume that any child of v 6 is a leaf, or a vertex with depth j whose maximal subtree is isomorphic to T v j + 1 for j = 2 , 3 , 4 . Let T be a tree obtained from T by removing v 3 , w , v 4 , z , v 5 , z and joining v 2 to v 6 . Clearly, any γ p ( T ) -set contains v 2 , v 6 and such a set can be extended to a PDS of T by v 3 , v 4 , v 5 yielding γ p ( T ) γ p ( T ) + 3 . Now, let f be a γ R p ( T ) -function, and let r = f ( v 3 ) + f ( w ) + f ( v 4 ) + f ( z ) + f ( v 5 ) + f ( z ) . To Roman dominate the vertices v 3 , w , v 4 , z , v 5 , z , we must have r 5 when f ( v 5 ) 1 or r = 4 when f ( v 5 ) = 2 . If r = 4 or r 5 and f ( v 6 ) 1 , then the function f restricted to T is a PRDF on T implying that γ R p ( T ) γ R p ( T ) + 4 . Hence assume that r 5 and f ( v 6 ) = 0 . Then the function h : V ( T ) { 0 , 1 , 2 } defined by h ( v 6 ) = 1 and h ( x ) = f ( x ) otherwise, is a PRDF on T yielding γ R p ( T ) γ R p ( T ) + 4 . By the induction hypothesis we obtain
γ R p ( T ) γ R p ( T ) + 4 γ p ( T ) + 1 + 4 γ p ( T ) 3 + 5 > γ p ( T ) + 1 ,
and the proof is complete.
According to Lemma 2 and Theorem 2, we have proven Theorem 1.

Author Contributions

Z.S. and S.M.S. contribute for supervision, methodology, validation, project administration and formal analyzing. S.K., M.C., M.S. contribute for investigation, resources, some computations and wrote the initial draft of the paper which were investigated and approved by Z.S. and M.C. wrote the final draft. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Key R & D Program of China (Grant No. 2019YFA0706402) and the Natural Science Foundation of Guangdong Province under grant 2018A0303130115.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Livingston, M.; Stout, Q.F. Perfect dominating set. Congr. Numer. 1990, 79, 187–203. [Google Scholar]
  2. Chaluvaraju, B.; Chellali, M.; Vidya, K.A. Perfect k-domination in graphs. Australas. J. Comb. 2010, 48, 175–184. [Google Scholar]
  3. Cockayne, E.J.; Hartnell, B.L.; Hedetniemi, S.T.; Laskar, R. Perfect domination in graphs. J. Comb. Inform. System Sci. 1993, 18, 136–148. [Google Scholar]
  4. Dejter, I.J.; Pujol, J. Perfect Domination and Symmetry. Congr. Numer. 1995, 111, 18–32. [Google Scholar]
  5. Fellows, M.R.; Hoover, M.N. Perfect domination. Australas. J. Comb. 1991, 3, 141–150. [Google Scholar]
  6. Li, Z.; Shao, Z.; Rao, Y.; Wu, P.; Wang, S. The characterization of perfect Roman domination stable trees. arXiv 2018, arXiv:1806.03164. [Google Scholar]
  7. Cockayne, E.J.; Dreyer, P.A., Jr.; Hedetniemic, S.M.; Hedetniemic, S.T. Roman domination in graphs. Discrete Math. 2004, 278, 11–22. [Google Scholar] [CrossRef] [Green Version]
  8. Revelle, C.S.; Rosing, K.E. Defendens imperium romanum: A classical problem in military strategy. Am. Math. Monthly 2000, 107, 585–594. [Google Scholar] [CrossRef]
  9. Stewart, I. Defend the Roman Empire. Sci. Am. 1999, 281, 136–139. [Google Scholar] [CrossRef]
  10. Henning, M.A.; Klostermeyer, W.F.; MacGillivray, G. Perfect Roman domination in trees. Discrete Appl. Math. 2018, 236, 235–245. [Google Scholar] [CrossRef]
  11. Alhevaz, A.; Darkooti, M.; Rahbani, H.; Shang, Y. Strong equality of perfect Roman and weak Roman domination in trees. Mathematics 2019, 7, 997. [Google Scholar] [CrossRef] [Green Version]
  12. Chellali, M.; Sheikholeslami, S.M.; Soroudi, M. A characterization of perfect Roman trees. Discrete Appl. Math. 2020. submitted. [Google Scholar]
  13. Henning, M.A.; Klostermeyer, W.F. Perfect Roman domination in regular graphs. Appl. Anal. Discrete Math. 2018, 12, 143–152. [Google Scholar] [CrossRef]
  14. Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. Roman domination in graphs. In Topics in Domination in Graphs; Haynes, T.W., Hedetniemi, S.T., Henning, M.A., Eds.; Springer: Basel, Switzerland, 2020. [Google Scholar]
  15. Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. Varieties of Roman domination. In Structures of Domination in Graphs; Haynes, T.W., Hedetniemi, S.T., Henning, M.A., Eds.; 2020; to appear. [Google Scholar]
  16. Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. Varieties of Roman domination II. AKCE J. Graphs Comb. 2020. to appear. [Google Scholar]
  17. Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. A survey on Roman domination parameters in directed graphs. J. Combin. Math. Comb. Comput. 2020. to appear. [Google Scholar]
  18. Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. The Roman domatic problem in graphs and digraphs: A survey. Discuss. Math. Graph Theory 2020. [Google Scholar] [CrossRef]
Figure 1. The graph H.
Figure 1. The graph H.
Mathematics 08 00966 g001

Share and Cite

MDPI and ACS Style

Shao, Z.; Kosari, S.; Chellali, M.; Sheikholeslami, S.M.; Soroudi, M. On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree. Mathematics 2020, 8, 966. https://doi.org/10.3390/math8060966

AMA Style

Shao Z, Kosari S, Chellali M, Sheikholeslami SM, Soroudi M. On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree. Mathematics. 2020; 8(6):966. https://doi.org/10.3390/math8060966

Chicago/Turabian Style

Shao, Zehui, Saeed Kosari, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, and Marzieh Soroudi. 2020. "On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree" Mathematics 8, no. 6: 966. https://doi.org/10.3390/math8060966

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop