^{1}

^{*}

^{2}

^{*}

In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.

E.J. Cockayne and S.T. Hedetniemi [

A subset S of vertices from V is called a dominating set for G if every vertex of G is either a member of S or adjacent to a member of S. A dominating set of G is called a minimum dominating set if G has no dominating set of smaller cardinality. The cardinality of minimum dominating set of G is called the dominating number for G and it is denoted by γ ( G ) [

The eccentricity of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. The eccentricity e ( v ) of v is defined by e ( v ) = max { d ( u , v ) : u ∈ V ( G ) } . The radius of a graph r ( G ) is defined by r ( G ) = min { e ( v ) : v ∈ V ( G ) } . The diameter of a graph d ( G ) is defined by d ( G ) = max { e ( v ) : v ∈ V ( G ) } . v is called a centre point if e ( v ) = r ( G ) and the set of all central point is called the centre of G. A spanning tree is a subset of a graph G, which has all the vertices covered with minimum possible number of edges, hence a spanning tree doesn’t have a cycle and it can’t be disconnected. A spanning tree of a graph G ( V , E ) with minimum diameter is called the minimum diameter spanning tree.

M. Yamuna and K. Karthika [

In this paper, we discuss few simple connected graphs for which the domination numbers of the graph and that of its minimum diameter spanning tree are the same.

In this section, we present few definitions and examples which are required for this article.

Definition 1. The spanning tree T of the simple connected graph G is said to be a minimum diameter spanning tree if there is no other spanning tree T' of G such that d ( T ′ ) < d ( T ) .

Definition 2. A vertex u of a simple connected graph is an essential dominating vertex, if every minimum dominating set contains the vertex u.

Example 1. In the graph given in

Definition 3. [_{n} to a singleton graph K_{1} with a bridge and we denote it by P n .

Example 2. The graphs given in

Definition 4. [_{n} is a planar undirected graph with 2n vertices and n + 2 ( n − 1 ) edges.

Example 3. The graph given in _{7}.

In this section we discuss the graphs which have minimum diameter spanning trees such that both have same domination number. It is clear to observe that cycle, regular graph, complete bipartite graph have minimum diameter spanning tree, possessing domination number same that of the graph.

Proposition 1. Every pan graph has at least one essential dominating vertex. In fact, the vertex, which is adjacent to the pendent vertex is an essential dominating vertex.

Proof: By definition 3 of a pan graph, it is a cycle in which one of the nodes in the cycle is adjacent to a node which is not in the cycle. Let u be the such vertex in the cycle, which is adjacent to the pendent vertex v. Since u is in the cycle, u is also adjacent to two other vertices, say x and y, in the cycle. Clearly, the vertex u dominates the three vertices v, x and y. Suppose u is not an essential dominating set, then there must exist another vertex in the cycle, which dominates the four vertices u, v, x and y. But obviously, no such vertex exists. Hence, u is an essential dominating vertex.

Let us recall the following results γ ( P n ) = ⌊ n + 2 3 ⌋ and γ ( P n ) = ⌊ n + 2 3 ⌋

Proposition 2. A pan graph P n has a minimum diameter spanning tree T for which γ ( P n ) = γ ( T ) if n ≡ 0 or 5 (mod 6)

Proof: Consider P n where n > 3 . To obtain a spanning tree of P n , we must remove an edge from the cycle. To obtain a minimum diameter spanning tree T, we must remove an edge which is far away from the pendant vertex. In other words, the path P n − 3 , obtained after the removal of the vertex u, must be separated in to two paths of length equal or one path has length 1 more than the other. Now, let us discuss the following cases.

Case 1: n ≡ 0 ( mod 6 )

Let n = 6 m for some positive integer. Then n − 3 = 6 m − 3 . Therefore the path P n − 3 = P 6 m − 3 can be separated into two paths P 3 m − 2 and P 3 m − 1 . Since γ ( P 3 m − 2 ) = ⌊ 3 m 3 ⌋ = m and γ ( P 3 m − 1 ) = ⌊ 3 m + 1 3 ⌋ = m , we have γ ( T ) = 2 m + 1 . But γ ( P n ) = ⌊ 6 m + 2 3 ⌋ = 2 m .

Case 2: n ≡ 1 ( mod 6 )

Let n = 6 m + 1 for some positive integer. Then n − 3 = 6 m − 2 . Therefore the path P n − 3 = P 6 m − 2 can be separated into two equal paths P 3 m − 1 . But γ ( P 3 m − 1 ) = ⌊ 3 m + 1 3 ⌋ = m and hence we have γ ( T ) = 2 m + 1 . Also γ ( P n ) = ⌊ 6 m + 3 3 ⌋ = 2 m + 1 .

Case 3: n ≡ 2 ( mod 6 )

Let n = 6 m + 2 for some positive integer. Then n − 3 = 6 m − 1 . Therefore the path P n − 3 = P 6 m − 1 can be separated into two paths P 3 m − 1 and P 3 m . But γ ( P 3 m − 1 ) = ⌊ 3 m + 1 3 ⌋ = m and γ ( P 3 m ) = ⌊ 3 m + 2 3 ⌋ = m , and hence we have γ ( T ) = 2 m + 1 . Also γ ( P n ) = ⌊ 6 m + 4 3 ⌋ = 2 m + 1 .

Case 4: n ≡ 3 ( mod 6 )

Let n = 6 m + 3 for some positive integer. Then n − 3 = 6 m . Therefore the path P n − 3 = P 6 m can be separated into two equal paths P 3 m . But γ ( P 3 m ) = ⌊ 3 m + 2 3 ⌋ = m , hence γ ( T ) = 2 m + 1 . Also γ ( P n ) = ⌊ 6 m + 5 3 ⌋ = 2 m + 1 .

Case 5: n ≡ 4 ( mod 6 )

Let n = 6 m + 4 for some positive integer. Then n − 3 = 6 m + 1 . Therefore the path P n − 3 = P 6 m + 1 can be separated into two paths P 3 m and P 3 m + 1 . But γ ( P 3 m ) = ⌊ 3 m + 2 3 ⌋ = m and γ ( P 3 m + 1 ) = ⌊ 3 m + 3 3 ⌋ = m + 1 , hence γ ( T ) = 2 m + 2 . Also γ ( P n ) = ⌊ 6 m + 6 3 ⌋ = 2 m + 2 .

Case 6: n ≡ 5 ( mod 6 )

Let n = 6 m + 5 for some positive integer. Then n − 3 = 6 m + 2 . Therefore the path P n − 3 = P 6 m + 2 can be separated into two equal paths P 3 m + 1 . But γ ( P 3 m + 1 ) = ⌊ 3 m + 3 3 ⌋ = m + 1 , hence we have γ ( T ) = 2 m + 3 . But γ ( P n ) = ⌊ 6 m + 7 3 ⌋ = 2 m + 2 .

Hence the proof of the proposition follows.

Proposition 3. The ladder graphs L_{n} have minimum diameter spanning tree T such that γ ( L n ) = γ ( T ) , only when n ≤ 3 or n is an even integer.

Proof: In a ladar graph L_{n}, the 2n vertices are divided in to two sets of each n vertices and each vertex of one set is adjacent to exactly one vertex of the other set and vice-versa. We may call these edges as step edges. Further, each of the n vertices are connected by a path on n − 1 edges. We may note that the diameter of a minimum diameter spanning tree of L_{n} is n, when n is odd and n + 1 , when n is even. In fact when n is odd, L_{n} has a unique minimum diameter spanning tree, which is obtained by deleting all the step edges, except the middle one. When n is even, there may be several minimum diameter spanning trees. The _{5} and L_{6}.

Further γ ( L n ) = 1 + ⌊ n 2 ⌋ .

Now let us consider the two cases on n

Case:1 n is odd.

When n is odd, the domination number of the unique minimum diameter spanning tree of L_{n} is given by 2 × ⌊ n 2 ⌋ . But this is equal to 1 + ⌊ n 2 ⌋ only when n = 3 .

Case:2 n is even.

When n is even, the domination number of the minimum diameter spanning tree of L_{n} is given by 2 + ⌊ 2 n − 1 4 ⌋ , because in a ladar graph, a node can dominate maximum four nodes, including itself. Since 2n is divisible by 4, the dominated nodes can be grouped with 4 nodes. The final 4 nodes can be found as 1 in one end and 3 in the other end. The 1 node is dominated by itself and in the 3 nodes, one node dominates the other two. Also this is equal to 1 + ⌊ n 2 ⌋ . Hence the proof follows.

An example is given in

In this article, we have discussed few graphs for which the domination number is the same that of its minimum diameter spanning tree. Further research can be done in exploring various graphs with the same property. The condition for which a graph does not posses such spanning tree may also be explored.

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

Chandrasekaran, V.T. and Rajasri, N. (2018) Minimum Diameter Spanning Tree. American Journal of Computational Mathematics, 8, 203-208. https://doi.org/10.4236/ajcm.2018.83016