0
  1. Trang chủ >
  2. Luận Văn - Báo Cáo >
  3. Báo cáo khoa học >

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

Báo cáo toán học:

Báo cáo toán học: " Order-distributions and the Laplace-domain logarithmic operator" docx

... time-domain order-distributions and the Laplace-domain logarithmic operator. This paperhas presented a theory of Laplace-domain logarithmic operators. The motivation is the appeara nce of logarithmic ... demonstratesthat the ln(s) operator appears frequently. The next section will review the necessary results from fractional calculus and the theory of order-distributions. It will then be shown that the Laplace-domain ... at the end of the articleAbstractThis paper develops and exposes the strong relationships that exist between time-domain order-distributions and the Laplace-domain lo garithmic operator. The...
  • 19
  • 389
  • 0
Báo cáo toán học:

Báo cáo toán học: " Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexe" doc

... 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-Macaulay if and only if (K) is sequentially ... nonpure shellable complex is sequentially Cohen-Macaulay. We show that algebraic shifting preserves the h-triangle of a simplicial complex Kif and only if K is sequentially Cohen-Macaulay. This generalizes...
  • 14
  • 182
  • 0
Báo cáo toán học:

Báo cáo toán học: " Tight Quotients and Double Quotients in the Bruhat Order" doc

... 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 Weylchamber C,andwà = à+ and w = +are dominant, we ... (Lemma 4.5) and the induction continues. For the numbering of the vertices of A0 in what follows, refer to Figure 4.Corollary 5.6. The Bruhat orderings of the double quotients (Bn.θ1)S, ... The (lack of) tight quotients in affine Weyl groups.Note that the standard ordering ofV generated byΦ induces partial orderings onany subset ofV , including the cross section X and the...
  • 41
  • 332
  • 0
Báo cáo toán học:

Báo cáo toán học: "The diameter and Laplacian eigenvalues of directed graphs" pps

... 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 theCheeger constant of a directed graph [4]. It is of interest to ... 0100472 and ITR 0205061.References[1] F. Chung, Diameters and eigenvalues, J. of Amer. Math. Soc. 2 (1989), 187-196.[2] F. Chung, V. Faber and T. A. Manteuffel, An upper bound on the diameter of...
  • 6
  • 226
  • 0
Báo cáo toán học:

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

... claw-free graphs with minimum degree atleast three that have equal total domination and matching numbers. Keywords: claw-free, matching number, total domination number1 IntroductionTotal domination ... graph G is a matching if no two edges in M are incidentto the same vertex. The matching number of G is the maximum cardinality of a matching of G.AsetS of vertices in G is a total dominating set ... 4-cycle containing both v1 and v2or containing both v3 and v4.Proof. Suppose, to the contrary, that there is a 4-cycle containing both v1 and v2orcontaining both v3 and v4. By symmetry,...
  • 28
  • 350
  • 0
Báo cáo toán học:

Báo cáo toán học: "Distance domination and distance irredundance in graphs" ppsx

... 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 aconnected graph in G). The minimum cardinality of a (connected) distance k-dominatingset in G is the (connected) distance k -domination number of G, denoted ... (connected) distance k-dominating setof G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected)distance...
  • 10
  • 389
  • 0
Báo cáo toán học:

Báo cáo toán học: "Tree-thickness and caterpillar-thickness under girth constraints" docx

... 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[S3] if S3is independent and S2= ∅.the electronic journal of combinatorics 15 (2008), #R93 6 Tree-thickness and caterpillar-thickness under girth constraintsQi Liu∗Douglas B. ... respectively.If the edge v1vgexists, then actually y = vg and z = v1, and x does not exist. In thiscase we add vg−1vg and vgvg+1to an old tree and put all other edges incident to A in T.If...
  • 11
  • 204
  • 0
Báo cáo toán học:

Báo cáo toán học: "Coverings, Laplacians, and Heat Kernels of Directed Graphs" ppt

... eigenfunctions of the Laplacian L(l).4 The heat kernel of a graph and its coveringWe 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 comparethe eigenvalues and eigenfunctions of the base and the cover graphs. As an application,we calculate the heat kernel of the homesick random walk on ... journal of combinatorics 16 (2009), #R31 8 Lemma 3.2. IfG is a covering of G, then an eigenvalue of G is an eigenvalue of G.Proof. IfG is a covering of G with respect to the map π of index...
  • 25
  • 207
  • 0
Báo cáo toán học:

Báo cáo toán học: "Clique-width and the speed of hereditary properties" doc

... and multipleedges. For a graph G, we denote by V (G) and E(G) the vertex set and the edges set of Grespectively. 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 the interva l correspondingto vertex i is the ... beginning and the end of the interval. The record now consists o f a list of vertices in the lower part, a separator, and a list of vertices in the upper par t containingat most n pairs of parentheses....
  • 11
  • 264
  • 0
Báo cáo toán học:

Báo cáo toán học: "Topological circles and Euler tours in locally finite graphs" pptx

... containing a finite odd cut of Gextends to an element of C.1 IntroductionErd˝os et al. [17] characterised the in nite graphs G containing an Euler tour, that is, atwo-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 example indi-cating why, ... applications in the study of hamil-tonicity in infinite graphs. If G is a locally finite graph then we define a Hamilton circleof G to be a circle in |G| containing all vertices (and hence also...
  • 16
  • 301
  • 0
Báo cáo toán học:

Báo cáo toán học: "Rationality, irrationality, and Wilf equivalence in generalized factor order" ppsx

... 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, wewill ... explainsall the Wilf equivalences in S5. In particular, the results of Section 4 and the lastparagraph of Section 5 generat e all of the Wilf equivalences in Table 1 with one exception. In ... “weakly increasing” and “maximum” have their usual meanings. Also, let w+mbe the result of applying the+ operator m times. By using the previous lemma a nd induction, we obtain the followingresult....
  • 26
  • 202
  • 0
Báo cáo toán học:

Báo cáo toán học: "Bootstrap Percolation and Diffusion in Random Graphs with Given Vertex Degree" pptx

... 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 Sequence. Let k  2 be a fixedinteger. The ... t) in the case of ra ndom graphs with g iven vertex degrees. The next section describes thismodel of ra ndom graphs. 1.1 Random Graphs with Given node Degrees In this paper, we investigate random...
  • 20
  • 259
  • 0
Báo cáo toán học:

Báo cáo toán học: "Dry matter and nitrogen allocation in western redcedar, western hemlock, a" ppsx

... production and survival in thefield. High N concentrations in seedlings may lead to Original articleDry 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 (1999) 669-678.[16] Hawkins ... relative dry -matter increment(Loge(DMfinal) - Loge(DMinitial); RDMI) and relative N increment (Loge(Nfinal) - Loge(Ninitial); RNI) in each soil and accumulated35...
  • 10
  • 296
  • 0

Xem thêm

Từ khóa: Báo cáo quy trình mua hàng CT CP Công Nghệ NPVNghiên cứu tổ chức pha chế, đánh giá chất lượng thuốc tiêm truyền trong điều kiện dã ngoạiNghiên cứu tổ hợp chất chỉ điểm sinh học vWF, VCAM 1, MCP 1, d dimer trong chẩn đoán và tiên lượng nhồi máu não cấpMột số giải pháp nâng cao chất lượng streaming thích ứng video trên nền giao thức HTTPGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitĐỒ ÁN NGHIÊN CỨU CÔNG NGHỆ KẾT NỐI VÔ TUYẾN CỰ LY XA, CÔNG SUẤT THẤP LPWANPhối hợp giữa phòng văn hóa và thông tin với phòng giáo dục và đào tạo trong việc tuyên truyền, giáo dục, vận động xây dựng nông thôn mới huyện thanh thủy, tỉnh phú thọPhát triển mạng lưới kinh doanh nước sạch tại công ty TNHH một thành viên kinh doanh nước sạch quảng ninhNghiên cứu về mô hình thống kê học sâu và ứng dụng trong nhận dạng chữ viết tay hạn chếQuản lý nợ xấu tại Agribank chi nhánh huyện Phù Yên, tỉnh Sơn La (Luận văn thạc sĩ)BT Tieng anh 6 UNIT 2Tranh tụng tại phiên tòa hình sự sơ thẩm theo pháp luật tố tụng hình sự Việt Nam từ thực tiễn xét xử của các Tòa án quân sự Quân khu (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 15: Tiêu hóa ở động vậtGiáo án Sinh học 11 bài 15: Tiêu hóa ở động vậtNguyên tắc phân hóa trách nhiệm hình sự đối với người dưới 18 tuổi phạm tội trong pháp luật hình sự Việt Nam (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtGiáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtĐổi mới quản lý tài chính trong hoạt động khoa học xã hội trường hợp viện hàn lâm khoa học xã hội việt namHIỆU QUẢ CỦA MÔ HÌNH XỬ LÝ BÙN HOẠT TÍNH BẰNG KIỀM