Báo cáo toán học: "On Vertex, Edge, and Vertex-Edge Random Graph" pot

... consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erd ˝ os-R ´ enyi random graphs, vertex random graphs are generalizations ... Every edge random graph is a vertex-edge random graph. (b) Every vertex random graph is a vertex-edge random graph. However, not all generalized edge...

Ngày tải lên: 08/08/2014, 14:23

... half-duplex mode, and hence the signal transmitted from the SMS is received at the DMS in N time slots. We can consider (8) as a mapping of a random process Ξ(t) to another random process C(t). ... values of the fading parameter m n and the numb er of hops N in N∗Nakagami-m channels. In Figures 4 and 5, we have also included the approximations obtained in (25) and (26), respective...

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

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

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

... (x t ,x μ − )=(x t ,x ν + )=1, and (x s ,x μ + )=(x s ,x ν − )=1, and (x p ,x μ − )= (x p ,x ν − )=1, and (x r ,x μ + )=(x r ,x ν + )=1. Consider two new binomials, denoted by f u+v and f u−v , obtained from f u and f v as ... term of f u and the first term of f v , by x t the g.c.d. of the first term of f u and the second term of f v , by x r the g.c.d. of the second term of f u...

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

... sufficient and necessary conditions of Hopfian and Co-Hopfian modules. In particular, we show that the weakly Co-Hopfian regular module R R is Hopfian, and the left R-module M is Co-Hopfian if and only ... Yang Gang and Liu Zhong-kui 13. A. Ghorbani and A. Haghany, Generalized Hopfian modules, J. Algebra 255 (2002) 324–341. 14. Robert Wisbauer, Foundations of Module and Ring theory, Gor...

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

... turns out to be sharp for some values of q , n and δ ,andfor q→∞ for any fixed n and δ . In addition, our bound reproves some old results of Ahlswede and others, such as the maximal value of |A|·|B| for ... accurate as Ahlswede’s result, but it is more general and it turns out to be sharp for some values of q, n and δ,andforq →∞ for any fixed n and δ. 2 Disconnected vertex sets Let...

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

... Σ n and having vertices x and y adjacent if and only if there is no i ∈{1, ,n} such that ix = iy. Similarly, Σ 0,1 n is the graph with vertex-set Σ n and having vertices x and y adjacent if and ... of computational group theory and graph theory in the discovery and classification of SOMAs. In particular, we discover and classify SOMA(3, 10)s with certain proper- ties, and d...

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

... as standard trees, and use them as equivalence class representatives. We will de- note the set of standard Catalan trees by standard(C) and the set of standard marked Catalan trees by standard(C, ... (2001), #R2 21 is standard if and only if T 1 = ,eachT i is standard, and . . . T T T 1 k k-1 ≥ T k+1 for all 1 ≤ k<n. Lemma 5.6. If the binary tree . . . T T n-1 n T 1 is standard an...

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

... coloured with the colours (1), (2) and (3) is 20 and the number of bi-chromatic blocks coloured with the colours (2) and (3) is at least 7 and so |T X 1 ∪X 2 ∪X 3 |≥27 and this is absurd. Let us consider ... {1} and not {2}; seven blocks contain {2} and not {1} and exactly one block contains the pair {1, 2}.Wemay assume that {1, 2, 3, 6}∈T X 1 ∪X 2 ∪X 3 and that the pair {3,...

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