Báo cáo toán học: "Induced paths in twin-free graphs" pptx

... minimal r -twin-free graph for the induced subgraph relationship. Indeed, we have: the electronic journal of combinatorics 15 (2008), #N17 5 An r -twin-free graph contains a path P 2r+1 as an induced ... vertices in graphs, IEEE Transactions on Information Theory, vol 44, pp. 599-611, 1998. [6] A. Lobstein, Bibliography on identifying and locating-dominating codes in graphs, http://www....

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

... remain in each U i this procedure can be applied repeatedly, thus finding at least (1 − 1 2 ) c a vertex disjoint induced copies of K(h, a) in each copy of K(h, c). Since there are at the beginning ... − 1 2 ) n hc vertex disjoint copies of K(h, c), this makes a total of at least (1−) n ha vertex disjoint induced copies of K(h, a)inG. Concluding remarks: Onemayaskifaminimumdegreeatleast...

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

... corresponding tableau is 421 3 . Clearly, two different standard paths give rise to different tableau. Furthermore, the tableau that occurs as tableau of standard paths must be increasing in every ... enumerated paths in the Hasse dia- gram of the following poset: the underlying set is that of all compositions, and a composition µ covers another composition λ if µ can be obtained from...

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

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

... bound follows by applying the Stirling approximation formula for factorials. It is worth noting that since every -regular graph with density d and 2n vertices contains, in each color class, at ... bound in Theorem 1 apply this estimate to the matrix A =(a u,v ) u∈V 1 ,v∈V 2 in which a u,v =1if u, v are adjacent and a u,v = 0 otherwise. Here M(G)=per(A). Since the function x! 1/x is inc...

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

... matching (or one-factor) of G is a subgraph of G in which each vertex has degree at most one. A basic question in combinatorial optimization is, “What is the size of a maximum matching in a given ... The set of incidence vectors of the matchings of G have a convex hull which is equal to the polytope containing all x ∈ R E which satisfy the following the electronic journal of combinatori...

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

... t). A join pair (G, t) is a join covered pair if each edge of G lies in a minimum t-join. Note that if T is a t-join in a join pair (G, t) and C is a circuit with more than half its edges in T , ... Clearly, C has a vertex in S and a vertex in V G\S (for instance, the ends of f ). Thus there are T -balanced paths joining v to vertices of C in S that contain an edge of T incident...

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

... [2]). In [1], Biggs introduced perfect codes in graphs. From this point of view, a perfect binary single-error correcting code of length k is a perfect code on the hypercube Q k ,and a tiling of ... 05C69,05C70,94B60 Abstract We introduce and study a common generalization of 1-error binary perfect codes and perfect single error correcting codes in Lee metric, namely perfect codes on pro...

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

... giving instructions. T23 felt that a persistence in doing routine activities in Chinese might result in teacher-fronted lessons in which individual students might only be speaking and practicing ... Shih-Chang Hsin. 2011. The development of TCSL teacher training in Taiwan . In Teaching and learning Chinese in global contexts, eds. Linda Tsung and Ken Cruickshank, 165-180. Co...

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

... 2007) incorporate boolean rules into constraint-based models for integrated simu- lation of regulatory and metabolic networks. Integrated FBA (iFBA) extends rFBA by integrating kinetic information ... Something from nothing – bridging the gap between constraint-based and kinetic modelling. FEBS J 274(21):5576–5585 Smallbone K, Simeonidis E, Swainston N, Mendes P (2010) Towards a genome-scale...

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