Báo cáo toán học: "Interchangeability of Relevant Cycles in Graphs" pot

Báo cáo toán học: "Interchangeability of Relevant Cycles in Graphs" pot

Báo cáo toán học: "Interchangeability of Relevant Cycles in Graphs" pot

... W∈P of the associated partition P can be expressed as a sum of a linearly independent set consisting of other cycles in W and shorter cycles. The motivation for introducing P originated in the ... set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum o...

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

16 301 0
Báo cáo toán học: " Protection of primary users in dynamically varying radio environment: practical solutions and challenges" pot

Báo cáo toán học: " Protection of primary users in dynamically varying radio environment: practical solutions and challenges" pot

... important to investigate suitable methods for reducing the PAPR of NC-OFDM transceivers with the 3 3.2 Windowing Windowing (W) is usually applied to the OFDM symbol time-domain samples with CP. The use of ... of the time domain non-continuity between subsequent OFDM symbols was the basis for a spectrum shaping method presented in [27]. This method is called N-continuous OFDM (NC). The...

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

51 376 0
Báo cáo toán học: "Glossary of Signed and Gain Graphs and Allied Areas" docx

Báo cáo toán học: "Glossary of Signed and Gain Graphs and Allied Areas" docx

... 13 sign of a polygon (in a signed graph) gain of a polygon (in a gain graph) Notation: σ(C), ϕ(C) • The product of the signs, or gains (taken in the order and direction of an ori- entation of the ... exhibits intrinsic disorder. More particularly, a model consisting of a weighted gain graph (“sites” joined by “bonds”) with “spins” at the sites that interact with the gains. Of...

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

41 408 0
Báo cáo toán học: "Intersections of Randomly Embedded Sparse Graphs are Poisson Edward" pdf

Báo cáo toán học: "Intersections of Randomly Embedded Sparse Graphs are Poisson Edward" pdf

... a special case.) This can be interpreted in terms of random embeddings of pairs of graphs in K n . Theorem 1, discusses random embeddings of t-tuples of graphs. In Theorem 2, we use this to extend ... m}. The number of injections of an m-set into an n-set is (n) m , the falling factorial (n) m = n(n − 1) ···(n−m+1). By a random embedding of G into K n , we mean that one...

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

10 254 0
Báo cáo toán học: "Distribution of Segment Lengths in Genome Rearrangements" doc

Báo cáo toán học: "Distribution of Segment Lengths in Genome Rearrangements" doc

... series in an in nite number of noncommuting indeterminates, in the ring ZU 1 , U 2 , . . .[[t]]. In Section 5.2, we will derive a formula for this series and apply the electronic journal of combinatorics ... subset of ˚ C n consisting of compositions that are permutations of µ. Each β ∈ E has per(β) distinct cyclic shifts, so the total number of compositions in C n obta...

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

56 213 0
Báo cáo toán học: "Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture" potx

Báo cáo toán học: "Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture" potx

... journal of combinatorics 16 (2009), #R57 13 2 Summary of Result s We propose t he following conditions a s fruitful interpretations of (1), (2), and (3) of Theorem 1.1 in varieties of loops in which ... Evans. The existence of complete mappings of finite groups. In Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Co...

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

15 298 0
Báo cáo toán hoc:"Vertex-oriented Hamilton cycles in directed graphs" pot

Báo cáo toán hoc:"Vertex-oriented Hamilton cycles in directed graphs" pot

... [4] Let G be a graph of order n and let β(G) be the maximum cardinality of a matching in G. Then β(G)  min{δ(G), ⌊ n 2 ⌋}. Proof of Theorem 9. Let D be a directed graph of order n. Let V (D) ... number of arcs of D directed out of v (respectively, directed into v). Let δ 0 (D) = min v∈V (D) {min{d + (v, D), d − (v, D)}}. The graph underlying D is the graph obtained from D by...

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

7 149 0
Báo cáo toán học: "Densities of Minor-Closed Graph Families" potx

Báo cáo toán học: "Densities of Minor-Closed Graph Families" potx

... topological closure of the set of densities of density-minimal graphs. Proof. By Corollary 8, the set of limiting densities of minor-closed graph families contains the set of densities of density-minimal ... minor of Fan(G, S, k) of the form Fan(G  , S  , k) where G  is a minor of G. Among all choices of G  leading to densest minors of this form, choose G  to be m...

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

21 536 0
Báo cáo toán học: "Subplanes of order 3 in Hughes Planes" ppt

Báo cáo toán học: "Subplanes of order 3 in Hughes Planes" ppt

... α ′ is the set of points, and β ′ the set of lines, of a subplane of order 3 in the Hughes plane H(q 2 ). the electronic journal of combinatorics 18 (2011), #P2 5 classes of elements of V  {(0, ... to points of H(q 2 ), and f injectively maps lines of L to lines of H(q 2 ), such that f(P ) lies on f (ℓ) (in H(q 2 )) if and only if the point P lies on the line ℓ (in L)...

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

8 199 0
Báo cáo toán học: "On Efficient Sets in R" potx

Báo cáo toán học: "On Efficient Sets in R" potx

... w.r.t. C in the sense of (2), while A has no efficient point w.r.t. C in the sense of (1). The set of efficient points of A w.r.t. C is called efficient set and denoted by E(A|C). If the interior of C ... pointed, and it fails for pointed cones whose closure is not pointed (e.g., the cone given in (4)). Hence, from the technical point of view, the replacement of the pointedness...

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

6 396 0
w