数学外文+中文翻译.docx

1、数学外文+中文翻译SIAM J. DISCRETE MATH.Vol. 26, No. 1, pp. 193205ROMAN DOMINATION ON 2-CONNECTED GRAPHSCHUN-HUNG LIUAND GERARD J. CHANGAbstract. A Roman dominating function of a graph G is a function f: V (G) 0, 1, 2 such that whenever f(v) = 0, there exists a vertex u adjacent to v such that f(u) = 2. The

2、weight of f is w(f) = . The Roman domination number of G is the minimum weight of a Roman dominating function of G Chambers,Kinnersley, Prince, and West SIAM J. Discrete Math.,23 (2009), pp. 15751586 conjectured that 2n/3 for any 2-connected graph G of n vertices.This paper gives counterexamples to

3、the conjecture and proves that max2n/3, 23n/34for any 2-connected graph G of n vertices. We also characterize 2-connected graphs G for which = 23n/34 when 23n/34 2n/3.Key words. domination, Roman domination, 2-connected graphAMS. subject classifications. 05C69, 05C35DOI. 10.1137/0807330851. Introduc

4、tion. Articles by ReVelle 14, 15 in the Johns Hopkins Magazine suggested a new variation of domination called Roman domination; see also 16 for an integer programming formulation of the problem. Since then, there have been several articles on Roman domination and its variations 1, 2, 3, 4, 5, 7, 8,

5、9, 10,11, 13, 17, 18, 19. Emperor Constantine imposed the requirement that an army or legion could be sent from its home to defend a neighboring location only if there was a second army which would stay and protect the home. Thus, there are two types of armies, stationary and traveling. Each vertex

6、(city) that has no army must have a neighboring vertex with a traveling army. Stationary armies then dominate their own vertices; a vertex with two armies is dominated by its stationary army, and its open neighborhood is dominated by the traveling army. In this paper, we consider (simple) graphs and

7、 loopless multigraphs G with vert ex set V (G) and edge set E(G). The degree of a vertex vV (G) is the number of edges incident to v. Note that the number of neighbors of v may be less than degGv in a loopless multigraph. A Roman dominating function of a graph G is a function f: V(G) 0, 1, 2 such th

8、at whenever f(v) = 0, there exists a vertex u adjacent to v such that f(u) = 2. The weight of f, denoted by w(f), is defined as.For any subgraph H of G, let w(f,H) =. The Roman dominationnumber of G is the minimum weight of a Roman dominating function.Among the papers mentioned above, we are most in

9、terested in the one by Chambers et al. 2 in which extremal problems of Roman domination are discussed. In particular, they gave sharp bounds for graphs with minimum degree 1 or 2 and boundsof + and . After settling some special cases, they gave the following conjecture in an earlier version of the p

10、aper 2.Conjecture (Chambers et al. 2). For any 2-connected graph G of n vertices, 2n/3。 This paper proves that max2n/3, 23n/34 for any 2-connected graph G of n vertices. Notice that 23n/34 is larger than 2n/3 by n/102. We also characterize 2-connected graphs G with = 23n/34 when 23n/34 2n/3. This wa

11、s in fact suspected by West through a private communication and proved after some discussions with him.2. Counterexamples to the conjecture. In this section, we give counterexamples to the conjecture by Chambers et al. 2.The explosion graph of a loopless multigraph G is the graph with vertex set V()

12、 = V (G) , , , , : e = xy E(G) and edge set E) =x, y , , , , e : e = xy E(G); see Figure 1. Notice that , , , induces a 5-cycle in , denoted by Ce. We call , , the inner vertices of Ce and of . Note that even if G has parallel edges, its explosion graph ,is a simple grapTheorem 1. There are infinite

13、ly many 2-connected graphs with Roman domination number at least 23n/34, where n is the number of vertices in the graph.Proof. Consider k graphs , . . . , , each isomorphic to , and their explosiongraphs , . . . , . Let G be a 2-connected graph obtained from the disjoint union of these explosion gra

14、phss by adding suitable edges between vertices of the original graphs s; i.e., these added edges and the s form a 2-connected graph. Then, G has n = 34k vertices.We claim that 23n/34 = 23k. Suppose to the contrary that 23k. Choose an optimal Roman dominating function f of G. Since =w(f) 23k, there i

15、s some with w(f,) w(f,) r 0 + (4 r)2 + 6 3 +（）or, equivalently, 2r 3 +（）,which is impossible as 0 r 4.The lower bound 23n/34 in the theorem above is in fact the exact value for the given graph G. This will be seen from the following theorem, whose proof employs a method that is useful in the entire

16、paper.For technical reasons, we often consider three Roman dominating functions , , and . We use to denote the 3-tuple (, ,), and (v) for ( (v), (v), (v). The weight of is w() =. Note that w( ) w()/3 for some j. A vertex v is -strong if (v) = 2 for some j.Theorem 2. If is the explosion graph of a lo

17、opless multigraph G without isolated vertices andhas vertices, then has a 3-tuple of Roman dominating functions such that w() 69/34 and every noninner vertex is -strong. Furthermore, if such satisfies w() = 69/34, then G is a disjoint union of s.Proof. If G has n vertices and m edges, then = n + 5m.

18、 We shall construct by first assigning values 0, 1, or 2 to the vertices in G. For this purpose, we order the vertices of G into , , . . . , and let be the subgraph of G induced by , . . . , as follows.Notice that = G. Starting from i = n, do the following loop: if Gi has a vertex of degree not equa

19、l to 3 or a vertex of degree 3 that has at most two neighbors, then choose it as vi; otherwise choose a vertex of degree 3 as vi and its three neighbors as , , . For the former case, let = and then replace i by i1 to repeat the loop; for the latter case, let = for k = i, i 1, i 2, i 3 and then repla

20、ce i by i 4 to repeat the loopEvery edge of G serves as a “back edge” of some , i.e., with i k. Hence, m = 。Once () has been defined for k 2n/3 and G contains no spanning subgraph isomorphic to the explosion graph of a disjoint union of K4s, then max2n/3, 23n/34, and any 2-connected graph of order w

21、ith + |E()| n+ |E(G)| satisfies R() max2n/3, 23/34. In particular, G is a minimally 2-connected graph. According to Lemma 4, we have the following claim.Claim 1. G does not have a cycle with a chord.Lemma 4 (Dirac 6, Plummer 12). A 2-connected graph is minimally 2- connected if and only if every cyc

22、le is an induced cycle.A cycle is pendent if it has no chords and all of its vertices except exactly two nonadjacent vertices are of degree 2.Claim 2. Any two pendent 5-cycles in G are vertex-disjointProof. Suppose to the contrary that G has two pendent 5-cycles and that are not vertex-disjoint. Let

23、 = and , be the two vertices of degree at least 3 for i = 1, 2, where = and possibly = . We now consider the graph obtained from the subgraph of G induced by V (G) : i = 1, 2, j = 2, 4, 5 by adding edges and . It is clear that is a 2- connected graph with = n6 vertices and |E()| |E(G)|. By the minimality of G, we have R() max2/3, 23/34. Choose a Roman dominating function of