Báo cáo toán học: "On subgraphs induced by transversals in vertex-partitions of graphs" potx

... analysis of the capacity of N∗Nakagami-m channels. Specifically, we have studied the influence of the severity of fading and the number of hops on the PDF, CDF, LCR, and ADF of the channel capacity. ... the expressions for the statistical properties of the channel capacity C(t). Again, by applying the concept of transformation of random variables...

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

... nonempty and closed sub- sets of B X such that lim n à(A n ) = 0, the set A = n=1 A n is nonempty and convex. (iv) The measure à satises the Cantor property in X. Proof. The equivalence of (i) and ... subsets of the bounded and convex set coC, then à(C n ) = 0 (n ∈ N), and therefore C ∞ = ∅. Appealing again to the ˇ Smulian theorem [6, Theorem V.6.2] we find t...

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

... that f(t) is strictly increasing in [1, +∞). 9 Sharp bounds for Seiffert mean in terms of root mean square Yu-Ming Chu ∗1 , Shou-Wei Hou 2 and Zhong-Hua Shen 2 1∗ Department of Mathematics, Huzhou ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/i...

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

... class="bi x0 y0 w2 h 1" alt =""

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

... δ). We establish these values in Sections 2, 3 and 4. TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE W. Edwin Clark University of South Florida Tampa, ... y.IfA⊆V then we let A denote the subgraph of G induced by A. Table 1 contains the value of γ(n, δ) for n ≤ 16, 0 ≤ δ ≤ n − 1 if the value is known, ot...

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

... contains some concluding remarks and related questions. 2. Background and results Noncrossing partitions. We first recall the definition of noncrossing partitions for the classical reflection groups ... address: athana@math.upenn.edu ON NONCROSSING AND NONNESTING PARTITIONS FOR CLASSICAL REFLECTION GROUPS CHRISTOS A. ATHANASIADIS Abstract. The number of noncrossi...

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

... graph of order n with domination number at least 3 and minimum degree δ satisfying n −2 √ n −4 ≤ δ ≤ n − √ 2 √ n. Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum ... combinatorics 7 (2000), #R58 19 [2] W. Edwin Clark and Larry A. Dunning, Tight Upper Bounds for the Domination Numbers of Graphs with...

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

... coloured differently. The upper and lower chromatic numbers ¯χ, χ are the maximum and minimum numbers of colours for which there exists a colouring using all the colours. The concepts of mixed hypergraph, upper and ... =3or χ =2. the electronic journal of combinatorics 8 (2001), #R6 7 On the upper and lower chromatic numbers of BSQSs(16) ∗ Giova...

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

... electronic journal of combinatorics 9 (2002), #R21 10 On counting permutations by pairs of congruence classes of major index H ´ el ` ene Barcelo and Robert Maule Sheila Sundaram Department of Mathematics ... give a constructive proof of an equivalent restatement of Propo- sition 2.5, by looking at the circular classes of permutations τ ∈ S n which fix n. Not...

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

... we are interested in the following question: can we use the functions θ(G),r(G)andd(G )in( 1)insteadofr + (G)? In the common case the answer is negative. The proof is based on the following lemmas. Lemma ... We are interested in studying the functions of the graph G whose values belong to the interval [α(G), χ(G)]. Here α(G) is the size of the largest sta...

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

... theoretically from the partition function Z gr by Mayer [22] around 1930. It is the starting point of Mayer’s theory of cluster integrals”. Mayer’s idea consists of setting 1+f ij =exp(−βϕ(| −→ x i − −→ x j |)), ... (30) and (34) analytically. the electronic journal of combinatorics 11 (2004), #R32 13 Enumerative problems inspired by Mayer’s theory of cluster i...

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

... related to the automorphism groups of trees have been investigated. We state, for instance, the enumeration of identity trees (see [7]), and the question of determining the average size of the automorphism ... to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symme...

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

... contains a subgraph on k − 1 vertices not in In(H) and by Proposition 2, there is a k-coloring of G avoiding rainbow induced copies of H. Therefore, if any k-coloring of G contains a rainbow induced ... x 10 .Butthen {x 10 ,x 1 ,x 2 ,x 5 } induces a rainbow Λ, a contradiction. Claim 3. Any coloring of G(3) in 4 colors contains an induced rainbow Λ. Let c be a coloring of...

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

... claw-free graphs with minimum degree at least three that have equal total domination and matching numbers. Keywords: claw-free, matching number, total domination number 1 Introduction Total domination ... graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G.AsetS of vertices...

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

... important during reactive hyperaemia than at rest, evidence of a potentiation of vasomotion by hyperaemia. Dur- ing midazolam infusion, an inhibition of this increase of vaso- motion induced by reactive ... 2 Example of a laser Doppler recording of blood flow during reactive hyperaemia in a patient sedated with midazolamExample of a laser Doppler recording of blood...

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