Báo cáo toán học: "Random Procedures for Dominating Sets in Graphs" doc

... (6). For the converse, let D be a minimum dominating set. Note that for every vertex v i ∈ V we have N G [v i ]∩D = ∅, since D is dominating and N G [v i ]∩D = N G [v i ], since D is minimum. Therefore, ... choices for the p i ’s 3 Optimizing the Results of Random Procedures Many random procedures constructing dominating sets essentially yield a bound on the domination num...

Ngày tải lên: 08/08/2014, 12:22

... α  ≥ k k  m α. 5. Defining the paths In this section we describe the key path constructions for our proof. For our finite group G,wesaythatB⊆Gis a minimal basis for G if B = G but for any proper subset ... is a minimal basis for G} . Further, define w(G)tobetheleastintegersuchthatforanyminimalbasisB, and any g ∈ G, we can write g as a product of at most w terms of the form x ±1...

Ngày tải lên: 07/08/2014, 06:22

... slow-moving or static scenarios in an indoor (residential or business) environment, there are ever-increasing demands for systematic deployment of moving networks in a vehicular environment such ... on interworking of complementary wireless technologies in an indoor (residential or business) environment such as offices, hotels, and airport terminals. Nonetheless, there are ever-increasi...

Ngày tải lên: 20/06/2014, 20:20

... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/instructions/ For information ... there exists t 3 > t 2 > 1 such that f(t) is strictly decreasing in [1, t 3 ] and strictly increasing in [t 3 , +∞). Therefore, inequality (2.1) follows from equations (2.3)–(2.5)...

Ngày tải lên: 20/06/2014, 21:20

Ngày tải lên: 05/08/2014, 15:20

... Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted. [4] I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some in nite regular ... unique index i for which x ∈ A i . Then we of course know, whether x is the point in A 2h ∩ Z 2k or the one in A 2h−1 ∩ Z 2k− 1 . Theorem 8 In the hexagonal grid, for r ≥...

Ngày tải lên: 07/08/2014, 06:22

... non-adjacent twins, then v, w are non-adjacent twins and u, w are non-adjacent twins. For a graph G, a set T ⊆ V (G) is a twin-set of G if v, w are twins in G for every pair of distinct vertices ... suffices to prove the sufficiency in Theorem 2.14 for graphs G whose maximal twin -sets have at most two vertices. We assume in the remainder of this section that every twin-set in G ha...

Ngày tải lên: 08/08/2014, 12:22

... pairs. the electronic journal of combinatorics 17 (2010), #R122 9 Substituting the above inequality into inequality (1) and rearranging gives |C ∩ Q m | |Q m−r |  6 37 . Taking the limit as m → ∞ gives ... of density in certain in nite graphs which are locally finite. We present new lower bounds for densities of codes for some sm all values of r in both the square and hexagonal grids...

Ngày tải lên: 08/08/2014, 12:22

... Another point to be mentioned is a delicate semantic difference between the meaning of these nouns in other constructions and in combination with prepositions. For example “dalil” in following ... this way tagging prepositions and parsing texts in Natural Language Processing is defined in a proper manner. 1 Introduction Prepositions have very versatile functions in...

Ngày tải lên: 08/03/2014, 02:21

... captures domain difference. Our results also show that incor- porating and exploiting more information from the target domain is much more useful than excluding misleading training examples from ... weighting method for domain adaptation. The first task is POS tagging, for which we used 268 Our idea of domain adaptation is to exploit the la- beled instances in the source domain to help o...

Ngày tải lên: 31/03/2014, 01:20