OJDMOpen Journal of Discrete Mathematics2161-7635Scientific Research Publishing10.4236/ojdm.2020.102006OJDM-99627ArticlesPhysics&Mathematics Unique Efficient Dominating Sets IsaacReiter1JuZhou1*Department of Mathematics, Kutztown University of Pennsylvania, Kutztown, PA, USA22012020100256689, January 202018, April 2020 21, April 2020© Copyright 2014 by authors and Scientific Research Publishing Inc. 2014This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/

Given a finite simple graph G, a set D &#8838; V( G ) is called a dominating set if for all vV( G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in D are adjacent, and D is perfect if each vertex not in D is adjacent to precisely one vertex in D. If a dominating set is both independent and perfect, then it is called an efficient dominating set. For a graph G, a set D is called a unique efficient dominating set of G if it is the only efficient dominating set of G. In this paper, the authors propose the definition of unique efficient dominating set, explore the properties of graphs with unique efficient dominating sets, and completely characterize several families of graphs which have unique efficient dominating sets.

Dominating Set Minimum Dominating Set Efficient Dominating Set Unique Efficient Dominating Set
1. Introduction

Let G be a simple finite graph and u , v be two vertices of G. We use d ( u , v ) to denote the distance, or the shortest length of paths between u and v , N ( u ) to denote the set of vertices adjacent to u and N [ u ] = N ( u ) ∪ { u } . Furthermore, we use d G ( u ) or d ( u ) to denote the cardinality of N ( u ) .

Given a finite simple graph G, a set D ⊆ V ( G ) is called a dominating set if for all v ∈ V ( G ) , either v ∈ D or v is adjacent to some vertex in D. For a graph G, the domination number is the size of the smallest possible dominating set. A dominating set D is independent if none of the vertices in D are adjacent and perfect if each vertex not in D is adjacent to precisely one vertex in D. If a dominating set is both independent and perfect, then it is called an efficient dominating set. Another way to define efficient dominating sets is to state that a vertex dominates its neighbors and itself when it is in the dominating set. Using this convention, an efficient dominating set is a dominating set that dominates every vertex in a graph exactly once. For a graph G, a set D is called a unique efficient dominating set of G if it is the only efficient dominating set of G.

The following theorem, which was proved in , establishes the fact that an efficient dominating set is also a minimum dominating set.

Theorem 1.1. If G has an efficient dominating set, then the cardinality of any efficient dominating set equals the domination number. In particular, all efficient dominating sets of G have the same cardinality.

The following lemma applies to all nontrivial efficient dominating sets.

Lemma 1.2. Let D be a nontrivial efficient dominating set of G. Then the following statements are true.

i) For any two vertices u , v ∈ D , d ( u , v ) ≥ 3 .

ii) For any vertex u ∈ D , there exists a vertex v ∈ D such that d ( u , v ) = 3 .

iii) V ( G ) is the disjoint union of all N [ u ] , where N [ u ] = N ( u ) ∪ { u } and u ∈ D .

iv) If u v ∈ E ( G ) and d ( v ) = 1 , then either u ∈ D or v ∈ D . Furthermore, if w ∈ N ( u ) \ { v } , then w ∈ D .

v) If v 1 , v 2 ∈ N ( u ) and d ( v 1 ) = d ( v 2 ) = 1 , then u ∈ D .

vi) If d ( u , v ) = 3 and d ( u ) = d ( v ) = 1 , then u , v ∈ D .

Proof. i) It follows directly from the fact that an efficient dominating set is independent and perfect.

ii) Let V 1 = N ( u ) and V 2 = N ( V 1 ) \ ( V 1 ∪ { u } ) . Since D is independent and perfect, V 1 ∩ D = ∅ and V 2 ∩ D = ∅ . This implies that the vertices in V 2 are dominated by one or more vertices other than u . Let v be one of these vertices. Then it follows that d ( u , v ) = 3 .

iii) For any v ∈ V ( G ) , if v ∈ D , there is a unique vertex u ∈ D such that v is dominated by u . That is to say, there is a unique vertex u ∈ D such that v ∈ N ( u ) . Therefore, V ( G ) is the disjoint union of N [ u ] for all the u ∈ D and so iii) follows.

iv) Since D is an efficient dominating set of G and d ( v ) = 1 , it follows that either u ∈ D or v ∈ D . If w ∈ N ( u ) \ { v } , then d ( u , w ) = 1 and d ( u , w ) = 2 . By i), w ∈ D .

v) Suppose that v 1 ∈ D . Since u v 1 ∈ E ( G ) and d ( v 1 , v 2 ) = 2 , u ∈ D and v 2 ∈ D , which contradicts iv). Therefore, v 1 ∈ D and by iv), u ∈ D .

vi) Let u u 1 v 1 v be a path of G. If u ∈ D , then u 1 ∈ D . By i), v 1 ∈ D and v ∈ D . So v is not dominated by any vertex in D, a contradiction. Therefore, u ∈ D and similarly v ∈ D .

Lemma 1.3. Suppose that H = G [ { v 1 , v 2 , v 3 , v 4 } ] is a path with d G ( v 2 ) = d G ( v 3 ) = 2 . Let D be an efficient dominating set of G. If v 1 ∈ D , then v 4 ∈ D .

Proof. By Lemma 1.2 i), v 2 ∈ D and v 3 ∈ D . By the fact that H is a path with d G ( v 2 ) = d G ( v 3 ) = 2 , v 4 ∈ D . Otherwise, v 3 is not dominated by any vertex in D.

In Section 2, the authors study operations on graphs with unique efficient dominating sets that generate new graphs with unique efficient dominating sets. In Section 3.1, the authors characterize the paths, cycles, and tadpole graphs which have unique efficient dominating sets. In Section 3.2, the authors prove that star/sunlet/centipede/firecracker graphs all have unique efficient dominating sets, and they characterize all the caterpillar graphs which have unique efficient dominating sets. In Section 3.3, the authors investigate spider graphs and fully characterize the spider graphs which have unique efficient dominating sets.

2. Properties of Unique Efficient Dominating Sets

The following two results are based on .

Theorem 2.1. Let G 1 and G 2 be two graphs with unique efficient dominating sets D 1 and D 2 , respectively. Let u 1 and u 2 be two vertices in V ( G 1 ) − D 1 and V ( G 2 ) − D 2 , respectively. If G is the graph obtained from G 1 ∪ G 2 by connecting u 1 and u 2 with an edge, that is, G = G 1 ∪ G 2 ∪ { u 1 u 2 } , then D 1 ∪ D 2 is the unique efficient dominating set of G.

Proof. Since for i = 1 , 2 , D i is the unique efficient dominating set of G i , D 1 ∪ D 2 is an efficient dominating set of G. Suppose that there exists an efficient dominating set D ′ of G. Suppose that u 1 ∈ D ′ . Then D ′ 1 = D ′ ∩ V ( G 1 ) is an efficient dominating set of G 1 . Since u 1 ∈ D ′ 1 and u 1 ∈ D 1 , D ′ 1 ≠ D 1 , contradicting the fact that G 1 has a unique efficient dominating set. Therefore, u 1 ∉ D ′ and similarly u 2 ∉ D ′ . Thus, for i = 1 , 2 , u i is dominated by a vertex of G i and so D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since D i is the unique efficient dominating set of G i , D ′ i = D i . So D ′ = D ′ 1 ∪ D ′ 2 = D 1 ∪ D 2 . Hence, D 1 ∪ D 2 is the unique efficient dominating set of G.

Theorem 2.2. Let G 1 and G 2 be two graphs with unique efficient dominating sets D 1 and D 2 , respectively. Let v 1 ∈ D 1 and v 2 ∈ D 2 . If G is the graph obtained from G 1 ∪ G 2 by adding two new vertices u 1 and u 2 , and three edges u 1 u 2 , u 1 v 1 and u 2 v 2 , then D 1 ∪ D 2 is the unique efficient dominating set of G.

Proof. Since for i = 1 , 2 , D i is the unique efficient dominating set of G i , D 1 ∪ D 2 is an efficient dominating set of G. Suppose that G has another efficient dominating set D ′ . Suppose that u 1 ∈ D ′ . Since u 2 is dominated by u 1 , v 2 ∉ D ′ . Then D ′ 2 = D ′ ∩ V ( G 2 ) is an efficient dominating set of G 2 with v 2 ∈ D ′ 2 . Since v 2 ∈ D 2 , D ′ 2 ≠ D 2 , contradicting the fact that D 2 is a unique efficient dominating set of G 2 . Hence, u 1 ∉ D ′ and similarly u 2 ∉ D ′ . In order to ensure that u 1 and u 2 are dominated, it is the case that v 1 ∈ D ′ and v 2 ∈ D ′ . So for i = 1 , 2 , D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since D i is the unique efficient dominating set of G i , D ′ i = D i and so D ′ = D ′ 1 ∪ D ′ 2 = D 1 ∪ D 2 . Hence, D 1 ∪ D 2 is the unique efficient dominating set of G.

The following theorem describes when identifying vertices results in a graph with a unique efficient dominating set.

Theorem 2.3. Let G 1 and G 2 be two graphs with unique efficient dominating sets D 1 and D 2 , respectively. Let v 1 ∈ D 1 and v 2 ∈ D 2 . If G is the graph obtained from G 1 ∪ G 2 by identifying v 1 and v 2 as a single vertex v , then D 1 ∪ D 2 is the unique efficient dominating set of G.

Proof. Since for i = 1 , 2 , D i is the unique efficient dominating set of G i , D 1 ∪ D 2 is an efficient dominating set of G. Let D ′ be another efficient dominating set of G. Suppose that v ∉ D ′ , and without loss of generality, suppose that v is dominated by a vertex in V ( G 1 ) ∩ D ′ . Then D ′ 1 = D ′ ∩ V ( G 1 ) is an efficient dominating set of G 1 . Since v 1 = v ∈ D ′ 1 and v 1 ∈ D 1 , D ′ 1 ≠ D 1 , contradicting the fact that G 1 has a unique efficient dominating set. Thus, v ∈ D ′ , and D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since D i is the unique efficient dominating set of G i , D ′ i = D i and so D ′ = D ′ 1 ∪ D ′ 2 = D 1 ∪ D 2 . Hence, D 1 ∪ D 2 is the unique efficient dominating set of G.

The following two theorems are special ways to identify vertices involving pendent vertices.

Theorem 2.4. Let G 1 and G 2 be two graphs with unique efficient dominating sets D 1 and D 2 , respectively. Let v 1 ∈ V ( G 1 ) and v 2 ∈ V ( G 2 ) be two pendant vertices such that v 1 ∈ D 1 and v 2 ∈ D 2 . Denote the neighbors of v 1 and v 2 as u 1 and u 2 , respectively. If G is the graph obtained from G 1 ∪ G 2 by identifying v 1 and v 2 as a single vertex v and by identifying u 1 and u 2 as a single vertex u , then G has the unique efficient dominating set D 1 ∪ D 2 .

Proof. Since for i = 1 , 2 , D i is the unique efficient dominating set of G i , D 1 ∪ D 2 is an efficient dominating set of G. Suppose that G has another efficient dominating set D ′ . Since u v ∈ E ( G ) and d ( v ) = 1 , by Lemma 1.2 iv), u ∈ D ′ or v ∈ D ′ . Suppose that u ∈ D ′ . Then for i = 1 , 2 , D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since u i = u ∈ D ′ i but u i ∈ D i , D ′ i ≠ D i , contradicting the fact that G i has a unique efficient dominating set. So u ∈ D ′ and then v ∈ D ′ . Now D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since D i is the unique efficient dominating set of G i , D ′ i = D i and so D ′ = D ′ 1 ∪ D ′ 2 = D 1 ∪ D 2 . Hence, D 1 ∪ D 2 is the unique efficient dominating set of G.

Theorem 2.5. Let G 1 and G 2 be two graphs with unique efficient dominating sets D 1 and D 2 , respectively. Let v 1 ∈ V ( G 1 ) and v 2 ∈ V ( G 2 ) be two pendant vertices with neighbors u 1 and u 2 such that u 1 ∈ D 1 and u 2 ∈ D 2 . If G is the graph obtained by identifying v 1 and v 2 as a single vertex v and by identifying u 1 and u 2 as a single vertex u , then G has the unique efficient dominating set D 1 ∪ D 2 .

Proof. Since for i = 1 , 2 , D i is the unique efficient dominating set of G i , D 1 ∪ D 2 is an efficient dominating set of G. Suppose that G has another efficient dominating set D ′ . Since u v ∈ E ( G ) and d ( v ) = 1 , by Lemma 1.2 iv), u ∈ D ′ or v ∈ D ′ . Suppose that v ∈ D ′ . Then for i = 1 , 2 , D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since v i = v ∈ D ′ i but v i ∈ D i , D ′ i ≠ D i , contradicting the fact that G i has a unique efficient dominating set. So v ∈ D ′ and then u ∈ D ′ . Now D ′ i = D ′ ∩ V ( G i ) is an efficient dominating set of G i . Since D i is the unique efficient dominating set of G i , D ′ i = D i and so D ′ = D ′ 1 ∪ D ′ 2 = D 1 ∪ D 2 . Hence, D 1 ∪ D 2 is the unique efficient dominating set of G.

Theorem 2.6. Suppose that H = G [ { v 0 , v 1 , v 2 , v 3 , v 4 } ] is a path with d G ( v 1 ) = d G ( v 2 ) = d G ( v 3 ) = 2 . Let G ′ be a graph obtained from G by deleting v 1 , v 2 , v 3 and connecting v 0 and v 4 . Then G has a unique efficient dominating set if and only if G ′ has a unique efficient dominating set.

Proof. Suppose that D is an efficient dominating set of G. If v 2 ∈ D , then by Lemma 1.2 i), v 0 ∈ D and v 4 ∈ D . In this case, D − { v 2 } is an efficient dominating set of G ′ . If v 2 ∈ D , then either v 1 ∈ D or v 3 ∈ D . Without loss of generality, suppose that v 1 ∈ D . By Lemma 1.3, v 4 ∈ D . Since v 0 ∈ D and ( N ( v 0 ) \ { v 1 } ) ∩ D = ∅ (since v 1 ∈ D ), D − { v 1 } is an efficient dominating set of G ′ with v 4 dominating v 0 .

Suppose that D ′ is an efficient dominating set of G ′ . If v 0 ∈ D ′ and v 4 ∈ D ′ , then D ′ ∪ { v 2 } is an efficient dominating set of G. If v 0 ∈ D or v 4 ∈ D , say v 0 ∈ D , then D ′ ∪ { v 3 } is an efficient dominating set of G.

The above proof shows that there is a one-to-one correspondence between the efficient dominating sets of G and the efficient dominating sets of G ′ . Therefore, G has a unique efficient dominating set if and only if G ′ has a unique efficient dominating set.

3. Graphs with Unique Efficient Dominating Sets

In this section, the authors investigate several families of graphs to determine the conditions which guarantee the existence of unique efficient dominating sets.

3.1. Paths, Cycles and Tadpole Graphs

For a positive integer n, denote the path with n vertices by P n = v 1 v 2 v 3 ⋯ v n .

Lemma 3.1. If G ≅ P n , then the following conclusions are true.

1) If n = 0 ( mod 3 ) , then G has a unique efficient dominating set.

2) If n = 1 ( mod 3 ) , then G has a unique efficient dominating set.

3) If n = 2 ( mod 3 ) , then G has two efficient dominating sets.

Proof. Suppose that D is an efficient dominating set of G.

1) The path P 3 has a unique efficient dominating set { v 2 } , and any path P n such that n = 0 ( mod 3 ) can be constructed from copies of P 3 by connecting the vertices on the ends. By Theorem 2.1, P n has a unique efficient dominating set D. Specifically, D = { v 2 , v 5 , v 8 , ⋯ , v n − 1 } .

2) The path P 4 has a unique efficient dominating set { v 1 , v 4 } and any path P n such that n = 1 ( mod 3 ) can be constructed from copies of P 4 by identifying the vertices on the ends. By Theorem 2.3, P n has a unique efficient dominating set D. Specifically, D = { v 1 , v 4 , v 7 , ⋯ , v n } .

3) By Lemma 1.2 iv), either v 1 or v 2 is in the efficient dominating set of G. By Lemma 1.3, D = { v 1 , v 4 , v 7 , ⋯ , v n − 1 } is an efficient dominating set of G if v 1 ∈ D , and D = { v 2 , v 5 , v 8 , ⋯ , v n } is an efficient dominating set of G if v 2 ∈ D . Thus, G has two efficient dominating sets.

Theorem 3.2. A path P n has a unique efficient dominating set if and only if n ≠ 2 ( mod 3 ) .

The following corollary follows from Theorem 2.3 and Lemma 3.1 2). It can be considered a generalization of Theorem 2.2.

Corollary 3.3. Let G 1 and G 2 be two graphs with unique efficient dominating sets D 1 and D 2 , respectively. Let v 1 ∈ D 1 and v 2 ∈ D 2 . If G is the graph obtained from G 1 ∪ G 2 ∪ P n , where n = 1 ( mod 3 ) , by identifying v 1 with one end vertex of P n and v 2 with the other end vertex of P n , then D 1 ∪ D 2 ∪ { v 4 , v 7 , ⋯ , v n − 3 } is the unique efficient dominating set of G.

Interestingly, trees can be formed by connecting and identifying vertices of paths. If a tree can be generated by combining paths with unique efficient dominating sets using the operations described in Section 2, the tree itself will also have a unique efficient dominating set.

The logical step after considering paths is to have a result for cycles. The following result follows from the previous theorem on paths.

Theorem 3.4. A cycle C n has an efficient dominating set if and only if n = 0 ( mod 3 ) . Furthermore, C n has 3 efficient dominating sets.

Proof. Let C n = v 1 v 2 v 3 ⋯ v n v 1 and let D be an efficient dominating set of C n . Since each vertex in D dominates two other vertices, the total number of vertices is a multiple of 3. Hence, n = 0 ( mod 3 ) . By Lemma 1.3, D 1 = { v 1 , v 4 , v 7 , ⋯ , v n − 2 } , D 2 = { v 2 , v 5 , v 8 , ⋯ , v n − 1 } , and D 3 = { v 3 , v 6 , v 9 , ⋯ , v n } are three efficient dominating sets of C n .

When we combine a path and a cycle, we can form a tadpole graph. The ( m , n ) -tadpole graph, also called a dragon graph, is the graph obtained from a cycle C m = u 1 u 2 ⋯ u m u 1 and a path P n = v 1 v 2 ⋯ , v n by connecting u 1 and v 1 .

Lemma 3.5. Let G be an ( m , n ) -tadpole graph, where m ≥ 3 , n = 0 ( mod 3 ) , and n ≥ 1 .

1) If n = 0 ( mod 3 ) , then G has 3 efficient dominating sets.

2) If n = 1 ( mod 3 ) , then G has a unique efficient dominating set.

3) If n = 2 ( mod 3 ) , then G has 2 efficient dominating sets.

Proof. Consider u 1 and its three neighbors u 2 , u m and v 1 . Exactly one of these 4 vertices is in D. If v 1 is in D, then by Lemma 1.3, u 3 must be in D, and similarly u 6 , u 9 , ⋯ , u m are all in D. But u 1 is dominated by two vertices u m and v 1 , a contradiction. Therefore v 1 ∈ D .

1) Suppose that n = 0 ( mod 3 ) . By Lemma 1.3, D = { u 1 , u 4 , u 7 , ⋯ , u m − 2 , v 3 , v 6 , v 9 , ⋯ , v n } is an efficient dominating set of G if u 1 ∈ D , D = { u 2 , u 5 , u 8 , ⋯ , u m − 1 , v 2 , v 5 , v 8 , ⋯ , v n − 1 } is an efficient dominating set of G if u 2 ∈ D , and D = { u 3 , u 6 , u 9 , ⋯ , u m , v 2 , v 5 , v 8 , ⋯ , v n − 1 } is an efficient dominating set of G if u m ∈ D . Therefore, G has 3 efficient dominating sets.

2) Suppose that n = 1 ( mod 3 ) . If u 2 ∈ D or u m ∈ D , then by Lemma 1.3, v 2 , v 5 , ⋯ , v n − 2 must be in D. In that case, v n cannot be efficiently dominated, a contradiction. So u 2 ∈ D and u m ∈ D , which means u 1 ∈ D . By Lemma 1.3, D = { u 1 , u 4 , u 7 , ⋯ , u m − 2 , v 3 , v 6 , v 9 , ⋯ , v n − 1 } is an efficient dominating set of G. Therefore, G has a unique efficient dominating set.

3) Suppose that n = 2 ( mod 3 ) . If u 1 ∈ D , then by Lemma 1.3, v 3 , v 6 , v 9 , ⋯ , v n − 2 are all in D. In that case, v n cannot be efficiently dominated, a contradiction. So u 1 ∈ D , which means u 2 ∈ D or u m ∈ D . By Lemma 1.3, D = { u 2 , u 5 , u 8 , ⋯ , u m − 1 , v 2 , v 5 , v 8 , ⋯ , v n } is an efficient dominating set of G if u 2 ∈ D , and D = { u 3 , u 6 , u 9 , ⋯ , u m , v 2 , v 5 , v 8 , ⋯ , v n } is an efficient dominating set of G if u m ∈ D . Therefore G has two efficient dominating sets.

Lemma 3.6. Let G be an ( m , n ) -tadpole graph, where m ≥ 3 and n ≥ 1 .

1) If m = 2 ( mod 3 ) , then G does not have an efficient dominating set.

2) If m = 1 ( mod 3 ) , then G has a unique efficient dominating set if and only if n ≠ 1 mod 3 .

Proof. Consider u 1 and its three neighbors u 2 , u m and v 1 . Exactly one of these 4 vertices is in D.

1) Suppose that m = 2 ( mod 3 ) . If u 1 ∈ D , then by Lemma 1.3, u 1 , u 4 , u 7 , ⋯ , u m − 1 ∈ D . In that case, u m is dominated by two vertices, a contradiction. If u 2 ∈ D , then by Lemma 1.3, u 2 , u 5 , u 8 , ⋯ , u m ∈ D . In that case, u 1 is dominated by two vertices, a contradiction. By argument similar to u 2 , u m ∈ D . If v 1 ∈ D , then by Lemma 1.3, u 3 , u 6 , u 9 , ⋯ , u m − 2 ∈ D . In that case, u m cannot be efficiently dominated, a contradiction. Thus, G does not have an efficient dominating set.

2) Suppose that m = 1 ( mod 3 ) . If u 1 ∈ D , then by Lemma 1.3, u 1 , u 4 , u 7 , ⋯ , u m ∈ D . Now u 1 and u m are both in D, a contradiction. If u 2 ∈ D , then by Lemma 1.3, u 2 , u 5 , u 8 , ⋯ , u m − 2 ∈ D and then u m cannot be efficiently dominated, a contradiction. By argument similar to u 2 , u m ∉ D . If v 1 ∈ D , then by Lemma 1.3, u 3 , u 6 , u 9 , ⋯ , u m − 1 ∈ D and v 4 , v 7 , ⋯ ∈ D . So only when n ≠ 0 ( mod 3 ) , G has a unique efficient dominating set.

The following complete characterization of tadpole graphs with unique efficient dominating sets follows from Lemma 3.5 and Lemma 3.6.

Theorem 3.7. Let G be an ( m , n ) -tadpole graph, where m ≥ 3 and n ≥ 1 . Then G has a unique efficient dominating set if and only if m = 0 ( mod 3 ) and n = 1 ( mod 3 ) , or m = 1 ( mod 3 ) and n ≠ 0 ( mod 3 ) .

Since Lemma 1.3 is used extensively, it will not be stated in the following proofs for the sake of brevity.

3.2. Sunlet/Centipede/Firecracker/Caterpillar Graphs

In this section, the authors prove that sunlet graphs, centipede graphs, and firecracker graphs all have unique efficient dominating sets. Furthermore, the authors characterize all the caterpillar graphs which have unique efficient dominating sets.

A k-star is a graph isomorphic to K 1, k with k ≥ 2 , where v is the center. The n-sunlet graph is the graph on 2n vertices obtained from a cycle C n = u 1 u 2 ⋯ u n u 1 by attaching n pendant edges u i v i , 1 ≤ i ≤ n . The n-centipede graph is the graph on 2n vertices obtained from a path P n = u 1 u 2 ⋯ u n by attaching n pendant edges u i v i , 1 ≤ i ≤ n . An ( n , k ) -firecracker is a graph obtained from n copies of k-stars by connecting v i v i + 1 , where v i is a leaf from the i-th star and 1 ≤ i ≤ n − 1 .

Theorem 3.8. If G is one of the following graphs, then G has a unique efficient dominating set of order n.

1) G is an n-sunlet graph.

2) G is an n-centipede graph with n ≥ 2 .

3) G is an ( n , k ) -firecracker with n , k ≥ 2 .

Proof. 1) By Lemma 1.2 vi), the set of all the pendant vertices of an n -sunlet graph is the unique efficient dominating set of G.

2) By Lemma 1.2 vi), the set of all the pendant vertices of an n -centipede graph is the unique efficient dominating set of G.

3) By Lemma 1.2 v), the center of each star is its unique efficient dominating set. Since G can be constructed from stars by the operation described in Theorem 2.1, G has a unique efficient dominating set, which is the set of all the centers of all the stars.

A caterpillar graph is a tree in which every vertex is on a central stalk or only one edge away from the stalk. In other words, removal of its endpoints leaves a path (central stalk). A tree is a caterpillar if and only if all vertices of degree at least 3 are surrounded by at most two vertices of degree two or greater.

We will call a vertex u on the main stalk a star vertex or s-vertex if d ( u ) ≥ 4 , and we will call a vertex u on the main stalk a p-vertex if d ( u ) = 3 ( p refers to the single pendant vertex of u ). Furthermore, we call a vertex u on the main stalk a trivial vertex if d ( u ) = 2 , and a nontrivial vertex if d ( u ) ≥ 3 . A pair of nontrivial vertices ( u , v ) is called a pair- n if there are no p-vertices or s-vertices between them and on the main stalk there are n mod 3 vertices between them.

To characterize the caterpillar graphs G which have unique efficient dominating sets, we can make the following assumptions.

a) G has at least two nontrivial vertices.

If G doesn’t have nontrivial vertices, then G is a path. If G has exactly one nontrivial vertex, then G is a spider graph. Both are discussed in this paper, respectively.

b) Every pendant vertex is adjacent to a nontrivial vertex.

If there are pendant vertices adjacent to a trivial vertex (vertex of degree 2) in a caterpillar graph, then there are at most two such vertices on the ends. The caterpillar graph can be decomposed into a caterpillar graph without such vertices and two paths.

c) There is no induced path of length 5 with internal vertices of degree 2 in G.

This assumption is based on Theorem 2.6. So for any pair- n , there are at most two vertices of degree 2 between them. This implies that for a pair- n , there are exactly n trivial vertices (vertices of degree 2) between them.

Lemma 3.9. Let G be a caterpillar graph with a unique efficient dominating set D. Let u ′ and v ′ be pendant vertices connected to u and v , respectively.

1) If u and v are a pair-2, then u , v ∈ D .

2) If u and v are a pair-0, then u ′ , v ′ ∈ D .

3) If u and v are a pair-1, then u ′ , v ∈ D and u is a p-vertex, or u , v ′ ∈ D and v is a p-vertex.

Proof. 1) Suppose that u 1 , v 1 are the two vertices of degree 2 between u and v such that u u 1 , u 1 v 1 , v 1 v ∈ E ( G ) . By Lemma 1.2 iv), u 1 ∈ D and v 1 ∈ D . In order to dominate u 1 and v 1 , we have u , v ∈ D .

2) By Lemma 1.2 iv), u ∉ D and v ∉ D . In order to dominate u and v , it is the case that u ′ , v ′ ∈ D . 3) Suppose that u ∈ D . By Lemma 1.2 i), v ∉ D . By Lemma 1.2 iv), v ′ ∈ D and by Lemma 1.2 v), v is a p-vertex. Similarly, we can prove that if v ∈ D , then u ′ ∈ D and u is a p-vertex.

For the caterpillar graph G, if there are more than one p-vertices v 1 , v 2 , ⋯ , v s such that v i v i + 1 ∈ E ( G ) for 1 ≤ i ≤ s − 1 , we will call ( v 1 , v 2 , ⋯ , v s ) a cluster of pair-0.

Lemma 3.10. Let G be a caterpillar graph and ( u , v ) be a pair-2 of G. Suppose that G ′ is the graph obtained from G by contracting the path of length 3 between u and v to a single vertex w. Then G has a unique efficient dominating set D if and only if G ′ has a unique efficient dominating set D ∪ { w } − { u , v } .

Proof. If G has a unique efficient dominating set D, then by Lemma 3.9 1), u , v ∈ D , and D ∪ { w } − { u , v } is an efficient dominating set of G ′ . If G ′ has a unique efficient dominating set D ′ , then by Lemma 1.2 v), w ∈ D ′ , and ( D ′ − { w } ) ∪ { u , v } is an efficient dominating set of G. Notice that there is a one-to-one correspondence between the efficient dominating sets of G and the efficient dominating sets of G ′ . Therefore, G has a unique efficient dominating set D if and only if G ′ has a unique efficient dominating set D ∪ { w } − { u , v } .

Based on Lemma 3.10, we can further assume that d) the caterpillar graphs under consideration don’t have pair-2.

Theorem 3.11. Let G be a caterpillar graph satisfying a)-d). Then G has a unique efficient dominating set D if and only if the following four conditions are true.

1) If G has more than one s-vertex, then for any two neighboring s-vertices u and v (no other s-vertices in between), then there are an even number of trivial vertices (vertices of degree 2) between them.

2) If G doesn’t have s-vertices, then G must have a pair-0.

3) Between any two neighboring clusters of pair-0 (no other cluster of pair-0 in between), there are even number of trivial vertices (vertices of degree 2).

4) Between an s-vertex and a cluster of pair-0, there are odd number of trivial vertices (vertices of degree 2).

Proof. Suppose that G is a caterpillar graph satisfying a)-d), and that G has a unique dominating set D.

Suppose that G has more than one s-vertices and let u and v be two neighboring s-vertices (no other s-vertices in between). By Lemma 1.2 v), u and v are both in D. Based on the assumption d), there are only pair-1 and pair-0 between u and v . Then there must be an even number of pair-1 between u and v . This is because when there is a sequence of consecutive pair-1, by Lemma 3.9 3) the vertex that is in D will alternate between being on the main stalk and being the pendant vertex. In order to ensure that the first vertex u and the last vertex v are both in D, there most be an even number of pair-1. So 1) is true.

Suppose that G does not have s-vertices. Suppose that G doesn’t have a pair-0. Then all the nontrivial vertices of G are p-vertices, and G doesn’t have pair-0 or pair-2. So by Lemma 3.9 3), G has two efficient dominating sets, a contradiction. So G must have a pair-0 and then 2) is true.

Suppose that u and v are two neighboring nontrivial vertices (no other nontrivial vertices in between) of G such that u is a vertex in a cluster of pair-0 and v is a vertex in another cluster of pair-0. By Lemma 3.9 2), u ′ ∈ D and v ′ ∈ D , where u ′ is the pendant vertex adjacent to u and v ′ is the pendant vertex adjacent to v . There must be even number of trivial vertices (vertices of degree 2) between u and v . So 3) is true.

Suppose that u and v are two neighboring nontrivial vertices (no other nontrivial vertices in between) of G such that u is an s-vertex and v is a vertex in a cluster of pair-0. Since u ∈ D and v ′ ∈ D , where v ′ is the pendant vertex adjacent to v , there must be odd number of trivial vertices (vertices of degree 2) between u and v . So 4) is true.

Conversely, suppose that G is a caterpillar graph satisfying a)-d) and 1)-4).

If G has s-vertices, then by Lemma 1.2 v), all the s-vertices are in D. Since G satisfies 1), 3) and 4), all the vertices between s-vertices, between clusters of pair-0, or between s-vertices and clusters of pair-0, are either in D or efficiently dominated.

Assume that G has exactly one s-vertex u and G has no cluster of pair-0. So all the nontrivial vertices of G except u are all p-vertices and G has pair-1 only. By Lemma 1.2 v), u ∈ D . By Lemma 3.9 3), the efficient dominating set of G is uniquely determined based on the fact that u ∈ D .

Similarly if G has exactly one cluster of pair-0, then all the nontrivial vertices of G are all p-vertices and G has pair-1 (except the cluster of pair-0) only. Then the efficient dominating set of G is uniquely determined.

3.3. Spider Graphs

The following results provide a comprehensive summary of efficient dominating sets of spider graphs, which is a specific type of tree.

For 1 ≤ i ≤ n , let L i = v 0 i v 1 i v 2 i ⋯ v l i i and let S ( v , l 1 , l 2 , l 3 , ⋯ , l n ) be the graph generated from L 1 , L 2 , ⋯ , L n by identifying v 0 1 , v 0 2 , ⋯ , v 0 n as a single vertex v . Then S ( v , l 1 , l 2 , l 3 , ⋯ , l n ) is called a spider graph with center v and n legs, where l i denotes the length and the number of vertices on the ith leg. If n = 1,2 , then S is just a path. Thus, the following theorems assume that S has at least 3 legs, that is, n ≥ 3 .

Lemma 3.12. Let G denote the spider graph S ( v , l 1 , l 2 , l 3 , ⋯ , l n ) with center v and n legs, where l i denotes the length of the ith leg. If G has a unique efficient dominating set D, then the following statements are true.

1) If v ∈ D , then l i ≠ 2 ( mod 3 ) .

2) If v 1 i ∈ D , then l i ≠ 0 ( mod 3 ) .

3) If v 1 i ∈ D , then l j ≠ 1 ( mod 3 ) for any j ≠ i .

Proof. 1) Suppose that v ∈ D . If l i = 2 ( mod 3 ) , then v 3 i , v 6 i , ⋯ , v l i − 2 i ∈ D . In this case, v l i i is not dominated by any vertex in D, a contradiction.

2) Suppose that v 1 i ∈ D . If l i = 0 ( mod 3 ) , then v 4 i , v 7 i , ⋯ , v l i − 2 i ∈ D . In this case, v l i i is not dominated by any vertex in D, a contradiction.

3) Suppose that v 1 i ∈ D . If l j = 1 ( mod 3 ) , then v 2 j , v 5 j , ⋯ , v l j − 2 j ∈ D . In this case, v l j j is not dominated by any vertex in D, a contradiction.

Lemma 3.13. Let G denote the spider graph S ( v , l 1 , l 2 , l 3 , ⋯ , l n ) with center v and n legs, where l i denotes the length of the i th leg.

1) If l i = 0 ( mod 3 ) for 1 ≤ i ≤ n , then G has a unique efficient dominating set.

2) If l i = 1 ( mod 3 ) for 1 ≤ i ≤ n , then G has a unique efficient dominating set.

3) If l i = 2 ( mod 3 ) for 1 ≤ i ≤ n , then G has n efficient dominating sets.

Proof. 1) By definition, G is generated from L 1 , L 2 , ⋯ , L n by identifying v 0 1 , v 0 2 , ⋯ , v 0 n as a single vertex v . Since l 1 , l 2 , ⋯ , l n are all equal to 0 mod 3, it is the case that L 1 , L 2 , ⋯ , L n are all paths with number of vertices equal to 1 (mod 3). By Theorem 3.1 2), for each 1 ≤ i ≤ n , L i has a unique efficient dominating set D i = { v 0 i , v 3 i , v 6 i , ⋯ , v l i i } . By Theorem 2.3, G has a unique efficient dominating set D = D 1 ∪ D 2 ∪ D 3 ∪ ⋯ ∪ D n , where we consider v 0 1 = v 0 2 = v 0 3 = ⋯ = v 0 n = v .

2) Consider the star graph K 1, n with center v . The center v has n neighbors v 1 1 , v 1 2 , ⋯ , v 1 n . By Lemma 1.2 v), { v } is the efficient dominating set. For 1 ≤ i ≤ n , define P k i = v 2 i v 3 i ⋯ v l i i . Then, k i = l i − 1 = 0 ( mod 3 ) vertices. By Lemma 3.1 1), P k i has a unique efficient dominating set D i = { v 3 i , v 6 i , v 9 i , ⋯ , v l i − 1 i } . Since G can be constructed from the star graph K 1, n and P k i , where 1 ≤ i ≤ n , by connecting v 1 i to v 2 i , by Theorem 2.1, G has a unique dominating set D = { v } ∪ D 1 ∪ D 2 ∪ D 3 ∪ ⋯ ∪ D n .

3) Let D be an efficient dominating set of G. If v ∈ D , then for 1 ≤ i ≤ n , v 3 i , v 6 i , ⋯ , v n − 2 i ∈ D and then v n i is not dominated by any vertex in D, a contradiction. Therefore, v ∈ D . Since v ∈ D , one of v 1 1 , v 1 2 , v 1 3 , ⋯ , v 1 n must be in D. If v 1 i ∈ D , then D i = { v 2 1 , v 5 1 , ⋯ , v l n 1 } ∪ { v 2 2 , v 5 2 , ⋯ , v l 2 2 } ∪ ⋯ ∪ { v 1 i , v 4 i , ⋯ , v l i − 1 i } ∪ ⋯ ∪ { v 2 n , v 5 n , ⋯ , v l n n } . Thus, G has n efficient dominating sets.

In the following proof, a Type-n leg is defined to be a leg with n mod 3 vertices, not counting the vertex that becomes the center.

Theorem 3.14. Let G denote the spider graph S ( v , l 1 , l 2 , l 3 , ⋯ , l n ) with center v and n legs, where l i denotes the length of the i th leg. Then G has a unique efficient dominating set if and only if one of the following holds.

1) G has Type-0 legs only.

2) G has Type-1 legs only.

3) G doesn’t have Type-1 legs, and G has exactly one Type-2 leg.

4) G has exactly one Type-1 leg, and G has a Type-2 leg.

5) G has more than one Type-1 leg, and G doesn’t have Type-2 legs.

Proof. Suppose that G has a unique efficient dominating set. We distinguish the following three cases.

Case 1: G doesn’t have Type-1 legs.

If G doesn’t have Type-2 legs, then G satisfies 1). If G has exactly one Type-2 leg, then G satisfies 3). Suppose that G has more than one Type-2 leg, and let L i = v v 1 i v 2 i ⋯ v l i i and L j = v v 1 j v 2 j ⋯ v l j j be two Type-2 legs. By Lemma 3.12 1), v ∈ D . Let L k = v v 1 k v 2 k ⋯ v l k k be the leg of G such that v 1 k dominates v . By Lemma 3.12 2), L k is not a Type-0 leg and so L k must be a Type-2 leg. If L m is a Type-2 leg with m ≠ k , then v 2 m , v 5 m , ⋯ , v l m ∈ D ; if L m is a Type-0 leg, then v 2 m , v 5 m , ⋯ , v l m − 1 ∈ D ; for the Type-2 leg L k , v 1 k , v 4 k , v 7 k , ⋯ , v l k − 1 ∈ D . In that case, G has more than one efficient dominating set, a contradiction.

Case 2: G has exactly one Type-1 leg.

Suppose that G does not have Type-2 legs. Then G has one Type-1 leg and more than one Type-0 legs. If v ∈ D , then v 3 i , v 6 i , ⋯ , v l i i ∈ D if L i is a Type-0 leg and v 3 i , v 6 i , ⋯ , v l i − 1 i ∈ D if L i is a Type-1 leg. If v ∈ D , then v 2 i , v 5 i , ⋯ , v l i − 1 i ∈ D if L i is a Type-0 leg and v 1 i , v 4 i , ⋯ , v l i i ∈ D if L i is a Type-1 leg. Now G has two efficient dominating sets, a contradiction. So G must have Type-2 legs and then G satisfies 4).

Case 3: G has more than one Type-1 leg.

Let L i = v v 1 i v 2 i ⋯ v l i i and L j = v v 1 j v 2 j ⋯ v l j j be two Type-1 legs. By Lemma 3.12 3), v ∈ D . Suppose that G has a Type-2 leg L k = v v 1 k v 2 k ⋯ v l k k . Then by Lemma 1.3, v 3 k , v 6 k , ⋯ , v l k − 2 k ∈ D . In this case, v l k k cannot be efficiently dominated. So G doesn’t have Type-2 legs. Therefore, G satisfies 2) or 5).

Conversely, if G satisfies 1) or 2), then by Lemma 3.13, G has a unique efficient dominating set. Suppose that D is an efficient dominating set of G. We prove that G has a unique efficient dominating set asuming G satisfies condition 3), 4) or 5), respectively.

3) G doesn’t have Type-1 legs, and G has exactly one Type-2 leg.

Since G has a Type-2 leg, by Lemma 3.12 1), v ∈ D . Then there is v 1 j ∈ D . By Lemma 3.12 2), L j is not a Type-0 leg. Since G doesn’t have Type-1 legs, L j must be the Type-2 leg. So for any Type-0 leg L i , v 2 i , v 5 i , ⋯ , v l i − 1 i ∈ D , and for the Type-2 leg L j , v 1 j , v 4 j , ⋯ , v l j − 1 j ∈ D . Thus, G has a unique efficient dominating set.

4) G has exactly one Type-1 leg, and G has a Type-2 leg.

Since G has a Type-2 leg, by Lemma 3.12 1), v ∈ D . Then there is v 1 j ∈ D . By Lemma 3.12 2), L j is not a Type-0 leg and by Lemma 3.12 3), L j is not a Type-2 leg. So L j must be the Type-1 leg. So for any Type-0 leg L i , v 2 i , v 5 i , ⋯ , v l i − 1 i ∈ D , for the Type-1 leg L j , v 1 j , v 4 j , ⋯ , v l j j ∈ D , and for any Type-2 leg L k , v 2 k , v 5 k , ⋯ , v l k k ∈ D . Thus, G has a unique efficient dominating set.

5) G has more than one Type-1 leg, and G doesn’t have a Type-2 leg.

Since G has more than one Type-1 leg, by Lemma 3.12 3), v 1 i ∈ D for any i . So v ∈ D and for any Type-0 leg L i , v 3 i , v 6 i , ⋯ , v l i i ∈ D , and for the Type-1 leg L j , v 3 j , v 6 j , ⋯ , v l j − 1 j ∈ D . Thus, G has a unique efficient dominating set.

3.4. Further Discussion

Theorem 3.15. Let G be a graph with independent set D = { u 1 , u 2 , ⋯ , u t } such that 1) V ( G ) \ D = N ( u 1 ) ∪ ˙ N ( u 2 ) ∪ ˙ ⋯ ∪ ˙ N ( v t ) and 2) for every vertex in x ∈ N ( u i ) and y ∈ N ( u j ) , x y ∈ E ( G ) . Then D = { u 1 , u 2 , ⋯ , u t } is the unique efficient dominating set of G.

Proof. Based on the fact that D is an independent set and every vertex in V ( G ) \ D is dominated by exactly one vertex from D, D is an efficient dominating set. We just need to prove that D is the only efficient dominating set of G.

Suppose that D ′ is an efficient dominating set. Suppose that u 1 ∈ D ′ . Then there must be a vertex v 1 ∈ N ( u 1 ) such that v 1 ∈ D ′ . Since D ′ is independent, no vertex of N ( u 2 ) can be an element of D ′ . Since d ( v 1 , u 2 ) = 2 , u 2 is not in D ′ (Otherwise, every vertex in N ( u 2 ) is dominated by v 1 and u 2 ). Now u 2 is not dominated by any vertex of D ′ . Therefore u 1 ∈ D ′ . Similarly, u i ∈ D ′ for any i . So D ⊆ D ′ . By Theorem 1.1, D = D ′ . So D is the unique efficient dominating set of G.

Corollary 3.16. Let G be a graph obtained from K s 1 , s 2 , ⋯ , s t = ( V 1 , V 2 , ⋯ , V t ) by adding u i and connecting u i to each vertex in V i for i = 1,2, ⋯ , t . Then D = { u 1 , u 2 , ⋯ , u t } is the unique efficient dominating set of G.

Corollary 3.17. Let G be a graph obtained from K n by adding u i and connecting u i to each vertex in V i for i = 1,2, ⋯ , t , where V ( K n ) = V 1 ∪ ˙ V 2 ∪ ˙ ⋯ ∪ ˙ V t . Then D = { u 1 , u 2 , ⋯ , u t } is the unique efficient dominating set of G.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

Reiter, I. and Zhou, J. (2020) Unique Efficient Dominating Sets. Open Journal of Discrete Mathematics, 10, 56-68. https://doi.org/10.4236/ojdm.2020.102006

ReferencesMostaghim, Z. and Kjalkhali, A.S. (2012) Efficient Dominating Sets in Ladder Graphs. International Journal of Engineering Research and Development, 2, 42-43.Hedetniemi J. ,et al. (2017)On Graphs Having a Unique Minimum Independent Dominating Set Australian Journal of Combinatorics 68, 357-370.Wolfram MathWorld (2019). http://mathworld.wolfram.com/