Báo cáo toán học: "A recurrence for bounds on dominating sets in k-majority tournaments" pps

... of D in V constitute a dominating set of T . The following variant of majority tournaments will prove useful for generating bounds for the size of dominating sets. Definition 1. A (t, m)-asymmetric ... partition of the vertex set V = A∪B, it may be that of the dominating set two vertices are in A and one in B. The following corollary shows that the dominating set may alwa...

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

... necessarily nonincreasing. the electronic journal of combinatorics 2 (1995), #R11 5 Proof. Define a function f on P  (n, k, l)byf (π)=α,whereα is obtained from π by deleting the first row and column in ... s<0. For the remaining conditions in (1) through (5) the value of |P(n, k, l, s)| is clear. Condition (6) follows from Lemma 5. For the general case (7), equate |P  (n, k, l, s...

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

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

... A recurrence relation for the “inv” analogue of q-Eulerian polynomials Chak -On Chow Department of Mathematics and Information Technology, Hong Kong Institute of Education, 10 Lo Ping Road, ... algebraically. In the final section, we give a combinatorial proof of this recurrence relation. 2 The recurrence relation We derive in the present section the recurrence relation by algeb...

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

... useful in- formation by monitoring phenomena in the surrounding environment. Common sensing tasks are heat, pressure, light, sound, vibration, presence of objects, etc. In WSNs, each sensor individually ... to route recovery procedure explained in the following section. 21 A virtual infrastructure based on honeycomb tessellation for data dissemination in multi- sink mobile wirel...

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

... M¨obius function formulation and several convex set expansions for β(G). Section 5 is devoted to an interesting example, simplicial shelling in chordal graphs. The main theorem of this section, Theorem ... evidence for this position. In addition, there are several interesting combinatorial interpretations (not explored here) for β(G) when G is a rooted graph, digraph, tree, poset or...

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

... unimodal. Acknowledgement. The authors wish to thank Doron Zeilberger for comments on an earlier version of this paper. References [1] BOROS, G. - MOLL, V.: An integral hidden in Gradshteyn and Rhyzik, J. Comp. Appl. ... F.: Log-concave and unimodal sequences in Algebra, Combinatorics and Geometry: an update. Contemporary Mathematics, 178, 71-84, 1994. [3] STANLEY, R.: Log-concave and...

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

... be one family of sequences) contains the sequences given by Conway and Guy and Lunnon. In particular, d  1 is the difference vector corresponding to the Conway–Guy sequence (for more on the Conway–Guy sequence ... we need no such permutation in the second region of definition as the differences are in ascending order). In other words, σ is the permutation for which σ(1) = n and, f...

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

... of covering codes. Our investigations lead to two optimization problems related to covering codes in which one leads to an exact solution (for binary codes). For instance, we show that for 0 <k<n,(n ... be ◦ an information provider,or ◦ an information user who incorrectly announces his hat color since he is not preceded by any information provider whom he can hear and trust, thus...

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

... G 2 ) = min{e(G) : G → (G 1 , G 2 )}. ∗ Supported in part by National Natural Science Foundation of China. the electronic journal of combinatorics 14 (2007), #N11 1 From the definition of W k , ... Gorgol, On bounds for size Ramsey numbers of a complete tripartite graph, Discrete Math. 164 (1997), 149–153. the electronic journal of combinatorics 14 (2007), #N11 5 • every vertex of V (F...

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