Báo cáo toán học: "Total domination and matching numbers in claw-free graphs" doc

... time- domain order-distributions and the Laplace-domain logarithmic operator. This paper has presented a theory of Laplace-domain logarithmic operators. The motivation is the appeara nce of logarithmic ... demonstrates that the ln(s) operator appears frequently. The next section will review the necessary results from fractional calculus and the theory of order-d...

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

... class="bi x0 y2 w2 h 3" alt =""

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

... alt =""

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

... communication) to ask, “Does algebraic shifting preserve sequential Cohen-Macaulayness?” and “Does algebraic shifting preserve the h-triangle of sequentially Cohen-Macaulay simplicial complexes?” Shifted ... shellable and hence sequentially Cohen-Macaulay, so ∆(K) is always sequentially Cohen-Macaulay. Thus, the “obvious” generalization, “K is sequentially Cohen-Mac...

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

... hypotheses of the above claim are satised, and hence x(à) x(). On the other hand, bearing in mind that à and are in the interior of the same Weyl chamber C,andwà = à + and w = + are dominant, we ... (Lemma 4.5) and the induction continues.  For the numbering of the vertices of A 0 in what follows, refer to Figure 4. Corollary 5.6. The Bruhat orderings of...

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

... factor of 4 of the bound for the undirected case. We have now seen that the eigenvalues of the Laplacian can be used to control the diameter of the graph. It is also known that the eigenvalues of ... for the rate of convergence in terms of λ? Another important consequence of the Laplacian eigenvalues is its relationship with the Cheeger constant of a directed g...

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

... generalizing a result of Favaron and Kratsch [4] regarding k = 1. Keywords: domination, irredundance, distance domination number, total domi- nation number, connected domination number, distance irredundance ... − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) dista...

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

... n-vertex graphs by enlarging the girth beyond 6. It remains to deter- mine the best bounds for girth 4 and girth 5 and to determine the best bounds for larger girth when trees are forbidden by ... components of G[S 3 ] if S 3 is independent and S 2 = ∅. the electronic journal of combinatorics 15 (2008), #R93 6 Tree-thickness and caterpillar-thickness under girth constra...

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

... eigenfunctions of the Laplacian L (l) . 4 The heat kernel of a graph and its covering We extend the definition of the heat kernel ([1]) to directed graphs. Given a weighted directed graph G, the heat kernel ... extend the methods of [3] and use them to compare the eigenvalues and eigenfunctions of the base and the cover graphs. As an application, we calculate the h...

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

... and multiple edges. For a graph G, we denote by V (G) and E(G) the vertex set and the edges set of G respectively. The complement of G is denoted G. The neighborhood of v ∈ V (G) is the set of ... giving the or der along the real line in which the starts and ends of intervals occur, and separately record the permutation σ, where the start point of th...

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

... containing a finite odd cut of G extends to an element of C. 1 Introduction Erd˝os et al. [17] characterised the in nite graphs G containing an Euler tour, that is, a two-way in nite walk traversing ... ny arc in |G| with on e endpoint in X and one in Y contains an edge from F . 4 Euler tours In this section we prove Theorem 1.3, but before we do so let us consider an exa...

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

... of the embedding factor w ′ = 343 which has embedding index 5, and the two 2’s of u are in po sitions 6 and 7. Note that we obtain ordinary factor order by taking P to be an antichain. Also, we will ... explains all the Wilf equivalences in S 5 . In particular, the results of Section 4 and the last paragraph of Section 5 generat e all of the Wilf equivalences in Table 1...

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

... Diffusion of innovations on random networks: Understanding the chasm. In Proceedings of WINE 2 008, pages 178–185, 2008. [20] M. Molloy and B. Reed. A critical point for random graphs with a given ... the study of percolation in a random graph with given vertex degrees. We refer to Section 3 for more details. k-Core in Random Graphs with Given Degree Seque...

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

... production and survival in the field. High N concentrations in seedlings may lead to Original article Dry matter and nitrogen allocation in western redcedar, western hemlock, and ... balance and organic acids in western redcedar, western hemlock, and Douglas fir seedlings grown in low- and high-N soils, Can. J. For. Res. 29...

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