Coronas and Domination Subdivision Number of a Graph

In this paper, for a graph G and a family of partitions P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {P}$$\end{document} of vertex neighborhoods of G, we define the general corona G∘P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G \circ \mathcal {P}$$\end{document} of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.

neighborhood, denoted by N G (v), is the set of all vertices adjacent to v. The cardinality of N G (v), denoted by d G (v), is called the degree of v. A vertex v is a leaf of G if d G (v) = 1. Every neighbor of a leaf is called a support vertex. A strong support vertex is a vertex adjacent to at least two leaves.
A subset D of V (G) is said to be dominating in G if every vertex belonging to V (G) − D has at least one neighbor in D. The cardinality of the smallest dominating set in G, denoted by γ (G), is called the domination number of G. A subset S of vertices in G is called a 2-packing if every two distinct vertices belonging to S are at distance greater than 2.
The corona of graphs G 1 and G 2 is a graph G = G 1 • G 2 resulting from the disjoint union of G 1 and |V (G 1 )| copies of G 2 in which each vertex v of G 1 is adjacent to all vertices of the copy of G 2 corresponding to v.
For a graph G, the subdivision of an edge e = uv with a new vertex x is an operation which leads to a graph G with V (G ) = V (G) ∪ {x} and E(G ) = (E(G) − {uv}) ∪ {ux, xv}. The graph obtained from G by the replacing every edge e = uv with a path (u, x 1 , x 2 , v), where x 1 and x 2 are new vertices, is called the 2-subdivision of G and is denoted by S 2 (G).
For a graph G and a family P The family P is called a vertex neighborhood partition of G and the graph G • P is called a P-corona (or shortly general corona) of G. The set {(v, 1): v ∈ V (G)} of vertices of G • P is denoted by E xt (G • P) and its elements are called the external vertices. Those vertices of G • P which are not external, are said to be internal.
Example 1 Let G be the graph shown in Fig. 1a and let P = {P(a), P(b), P(c), Then the P-corona G • P is the graph G 1 given in Fig. 1b     From the definition of general corona, it obviously follows (as we have seen in the above example) that Let H be a subgraph of a graph G. The contraction of H to a vertex is the replacement of H by a single vertex k. Each edge that joined a vertex v ∈ V (G) − V (H ) to a vertex in H is replaced by an edge with endpoints v and k. Let } be two vertex neighborhood partitions of G. We say that P is a refinement of P and write P ≺ P if for every v ∈ V (G) and every A ∈ P (v) there exists B ∈ P(v) such that A ⊆ B. If P ≺ P, then the general corona G • P is said to be refinement of G • P. In this case, we write G • P ≺ G • P and say that G • P has been obtained from G • P by splitting some of its internal vertices. On the other hand, G • P can be obtained from G • P contracting some of its internal vertices. For example, G 2 from Fig. 1 is refinement of G 3 and G 3 is refinement of G 1 , so G 2 ≺ G 3 ≺ G 1 . Notice that in general, a graph G • P can be treated as a graph obtained from corona G • K 1 , where we split every support vertex v according to the partition P(v) of N G (v). Let us again consider the graphs G, G 1 , G 2 and G 3 from Fig. 1. The graph G 2 = S 2 (G) can be obtained from G • K 1 by splitting support vertex into maximum possible number of vertices. Moreover, if , and we leave other support vertices unchanged, then we obtain G 3 . On the other hand, G 3 can be obtained from G 2 = S 2 (G) contracting (a, {c}) and (a, {b}), and also (b, {c}) and The contraction (splitting) of internal vertices is called an internal contraction (splitting). We have the following observations: Observation 2 Let T be a tree with at least three vertices. Then, the following properties are equivalent: 1. T is a general corona of a tree.

There exists a tree T such that T is obtained from the 2-subdivision S 2 (T ) by a sequence of internal contractions.
3. There exists a tree T such that T is obtained from the corona T • K 1 by a sequence of internal splittings.

Observation 3 If G is a general corona of a tree, then E xt (G) is a dominating 2packing of G containing all leaves of G.
Proof It follows from the following three facts: The distance between any two external vertices of G is at least three. Next, every internal vertex of G is adjacent to an external vertex. Finally, every leaf of G belongs to E xt (G).

Observation 4 Let G and H be general coronas of some trees. If they share only one vertex which is an external vertex in each of them, then G ∪ H is a general corona.
Proof Assume that G and H are general coronas of some trees T 1 and T 2 , say G = T 1 • P 1 and H = T 2 • P 2 for some neighborhood partitions P 1 and P 2 of T 1 and T 2 , respectively. Let (v, 1) be the only common external vertex of G and H . Then the trees T 1 and T 2 share only v and the union T = T 1 ∪ T 2 is a tree. Now, let P be the family {P(x): Fig. 2. (v, 1) be an external vertex of G. If we contract two distinct neighbors of (v, 1), then the resulting graph is also a general corona of a tree.

Observation 5 Let G be a general corona of a tree and let
(v,A) From Observations 4 and 5, we immediately have the next observation (see Fig. 4 for an illustration).

Trees with Domination Subdivision Number 3
The domination subdivision number of a graph G, denoted by sd(G), is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Since the domination number of the graph K 2 does not increase when its edge is subdivided, we consider the subdivision numbers for connected graphs of order at least 3. The domination subdivision number was defined by Velammal [8] and since then it has been widely studied, see [2][3][4][5][6] to mention just a few.
It was shown in [8] that the domination subdivision number of a tree is either 1, 2, or 3. Let S i be the family of trees with domination subdivision number equal to i for i ∈ {1, 2, 3}. Some characterizations of the classes S 1 and S 3 were given in [2] and [1], respectively. In particular, the following constructive characterization of S 3 was given in [1].
Let the label of a vertex v be denoted by l(v) and l(v) ∈ {A, B}. Now, let F be the family of labeled trees that (i) contains P 4 , where leaves have label A and support vertices have label B, and (ii) is closed under the following two operations, which extend a labeled tree T ∈ F by attaching a labeled path to a vertex v ∈ V (T ) in such a way that: The following characterization of trees belonging to the class S 3 was given in [1].

Theorem 7
The next three statements are equivalent for a tree T with at least three vertices: 1. T belongs to the class S 3 .
2. T has a unique dominating 2-packing containing all leaves of T .

T belongs to the family F.
Now we are in position to give a new characterization of trees belonging to the class S 3 . Namely, we shall show that all these graphs precisely are general coronas of trees.

Lemma 8 If a tree T is a general corona, then T belongs to S 3 .
Proof From Observation 3, the set of external vertices of T is a dominating 2-packing containing all leaves of T and, consequently, by Theorem 7, T ∈ S 3 .

Lemma 9 If a tree T belongs to S 3 , then T is a general corona.
Proof We use induction on n, the number of vertices of a tree. The smallest tree belonging to S 3 is a path P 4 and, obviously, P 4 is a P-corona of P 2 . Let T ∈ S 3 be a tree on n vertices, n > 4. We will show that T is a general corona. Let P = (v 0 , v 1 , . . . , v k ) be the longest path in T . From the choice of P, since T does not have a strong support vertex (by Theorem 7), it follows that k 4 and d T (v 1 ) = 2. We consider two cases: Case 1: d T (v 2 ) = 2. Let T 1 and T 2 denote subtrees T [{v 0 , v 1 , v 2 , v 3 }] and T − {v 0 , v 1 , v 2 }, respectively. By Theorem 7, the tree T has a dominating 2-packing S containing all leaves of T and certainly {v 0 , v 3 } ⊆ S. Consequently, S − {v 0 } is a dominating 2-packing in T 2 containing all leaves of T 2 . Again by Theorem 7, the tree T 2 belongs to S 3 . Thus, by induction, T 2 is a general corona. Since v 3 belongs to S − {v 0 }, by Observation 3 and Theorem 7, v 3 ∈ E xt (T 2 ). Obviously T 1 = P 4 is a general corona. Because v 3 is also an external vertex in T 1 , and trees T 1 and T 2 do not share any other vertex, T = T 1 ∪ T 2 is a general corona by Observation 4.
Case 2: d T (v 2 ) > 2. In this case, again by Theorem 7, the tree T has a dominating 2-packing S containing all leaves of T . Let v be the unique neighbor of v 2 belonging to S. Since S is a 2-packing containing all leaves of T , v is not a support vertex in T . Thus, from the choice of P, it follows that either v is a leaf or v = v 3 . In both cases, let T 1 and T 2 be subtrees T [{v 0 , v 1 , v 2 , v }] and T − {v 0 , v 1 }, respectively. It is easy to observe that S − {v 0 } is a dominating 2-packing in T 2 containing all leaves of T 2 . Now, again by Theorem 7, the tree T 2 belongs to S 3 . Thus, by induction, T 2 is a general corona. Since v belongs to S − {v 0 }, by Observation 3 and Theorem 7, v ∈ E xt (T 2 ). Certainly T 1 = P 4 is a general corona and v is external vertex in T 1 . In addition, T 1 and T 2 share only the edge v 2 v . Consequently, by Observation 6, the tree T = T 1 ∪ T 2 is a general corona.
Taking into account Observation 2, Theorem 7, Lemmas 8 and 9 we have the summary result.
Theorem 10 Let T be a tree with at least three vertices. Then, the following properties are equivalent: