Báo cáo toán học: "Fixing Numbers of Graphs and Groups" pptx
Báo cáo toán học: " Improved labelling of DTPA- and DOTA-conjugated peptides and antibodies with In-111 in HEPES and MES buffer" ppt
... DOTA-octreotide, DTPA-anti-CAIX and DOTA-anti-CAIX in 0.1-M NaAc, NH4Ac, MES and HEPES buffers. Figure 4. Radiolabelling of DTPA-exendin-3 with 111 In. Radiolabelling of DTPA-exendin-3 with 111 In ... antibody were five times higher in MES and HEPES buffer. Radiolabelling of DTPA-exendin-3, DOTA-exendin-3 and DTPA-anti-CAIX antibody in MES and HEPES buffer resulted in twofold higher specific ... We showed improved labelling of DTPA- and DOTA-conjugated peptides, proteins and antibodies with 111 In when HEPES or MES buffer was used for radiolabelling. The enhanced labelling efficiency...
- 16
- 363
- 0
Báo cáo toán học: " Selective preparation of zero- and onedimensional gold nanostructures in a TiO2 nanocrystal-containing photoactive mesoporous template" pdf
... NANO EXPRESS Open Access Selective preparation of zero- and one-dimensional gold nanostructures in a TiO2 nanocrystal-containing photoactive mesoporous templateGo Kawamura1*, Teruhisa Okuno2, ... nanostructures [GNSs] were mainly obtained in the mesopores when a small amount of TiO2-containing mesoporous SiO2-TiO2was used as a template, whereas the use of a template containing a ... tetra-n-buto xide [TTB] and HAuCl4were acquiredfrom Wako Pure Chemical Industries, Ltd. (Osaka, Japan) and Kishida (Osaka, Japan), respectively.Synthesis of mesoporous templateThe preparation...
- 8
- 370
- 0
Báo cáo toán học: "Ergodic actions of compact abelian groups " ppsx
... alt ="" ...
- 33
- 342
- 0
Báo cáo toán học: "Ramseyan Properties of Graphs by Ermelinda DeLaVina" doc
... the class of all 4-chromatic graphs. The structure of the red graph is obvious by Corollary, but we do not knowwhich graphs can occur as blue graphs and what are the properties of graphs inwhich ... on the Wall, a list of conjectures of Graffiti. Ramseyan Properties of Graphs by Ermelinda DeLaVinadelavina@math.uh.eduSiemion Fajtlowiczsiemion@math.uh.eduUniversity of Houston, Houston, ... conjectured by the first author who also proved it in somecases and established all lower bounds. Examples of critical P (r, b) graphs aredisjoint unions of b − 1 copies of of complete k-partite graphs...
- 5
- 317
- 0
Báo cáo toán học: " Orthogonal Colorings of Graphs" ppt
... The notion of orthogonal colorings is strongly related to thenotion of orthogonal Latin squares. The orthogonal chromatic number of G, denoted byOχ(G), is the minimum possible number of colors ... 2, 3, 1, 3).The notion of k -orthogonal colorings is strongly related to the notion of orthogonal Latinsquares. Recall that two Latin squares L1,L2 of order r are orthogonal if for any orderedpair ... well-known that orthogonal Latin squares exist for everyr/∈{2, 6} (cf. [6]). A family of k -orthogonal Latin squares of order r,isasetofk Latinsquares every two of which are orthogonal. It is...
- 14
- 321
- 0
Báo cáo toán học: "Nim-Regularity of Graphs" docx
... parts are all of size one.Alternately, the complement of such a graph either has no edges or consists of the thedisjoint union of three or fewer complete graphs.Proof. The complement of K−5is ... similar proofs for complexes of dimension 2 and higher. We conjecture that the answer is “yes,” but the complexity of the proof would be astronomical, even for dimension 2. Hidden in the proof of Proposition ... K−5are not Nim-regular.Proof. Non-Nim-regularity of the shriek is an easy proof and can be found in [1].Let the vertices of K−5be a, b, c, d and e,andae bethepairofverticesthatdonotform an...
- 8
- 295
- 0
Báo cáo toán học: "Distinguishing numbers for graphs and groups" docx
... |Γ|≤m! and the subset {y1, ,yj} satisfies1. φ(yi)=i for each i,2. yi+1is in Γi−1.yi for each i from 2 to j − 1, and y1is in Γj−1.yj,then j ≤ m and |Γi−1.yi|≥j − i + 2for each ... shows this and twoother graphs with the same automorphism group and demonstrates that all three havedifferent distinguishing numbers. This example disproves a conjecture in [AC2] that for no group ... theorem completely characterizes group actions for which |Γ| = n !and the distinguishing number is n. It generalizes a conjecture of Albertson and Collins for graphs that is proven in Theorem 4.2.The...
- 13
- 298
- 0
Báo cáo toán học: "Splitting Numbers of Grids Dwight Duffus" pps
... pleasingcharacterization of these integer vectors. We do have a couple of observations about thisthe electronic journal of combinatorics 12 (2005), #R17 29 Splitting Numbers of Grids Dwight DuffusMathematics ... 1)yk+1.This completes the proof of (7) and verification of the upper bound. The proof of Theorem 1 is complete.Note that, by (7) and the remark following the proof of (6), all the orientations ... was noted at the beginning of Đ2, any member o of Okcanberegardedasak-sequence of s and ↓’s. Identify ↑ with 0 and ↓ with 1, so Okis the set of all binarysequences of length k.Let≺ denote...
- 31
- 163
- 0
Báo cáo toán học: "The number of graphs not containing K3,3 as a minor" pptx
... Hence, the class of (maximal) planar graphs is contained in the class of maximalK3,3-minor-free graphs and we can use the number of planar graphs and the number of triangulations as lower bounds. ... preliminary version available athttp://algo.inria.fr/flajolet/Publications[7] O. Gim´enez and M. Noy. The number of planar graphs and properties of randomplanar graphs. J. Amer. Math. Soc. (to appear), ... number of planar graphs. Already in1962, the asymptotic number of triangulations was given by Tutte [15]. Investigating howmuch the number of planar graphs (triangulations) differs from (maximal)...
- 20
- 248
- 0
Báo cáo toán học: "Saturation Numbers of Books" ppsx
... set X of b − 1 vertices, each of degree n − 1, a clique L of p2vertices, athe electronic journal of combinatorics 15 (2008), #R118 7 Saturation Numbers of BooksGuantao Chen∗Dept. of Math. ... has a set X of b−1vertices, each of degree n − 1, a clique L of p2vertices, a set T of n − p/2 − b + 1 verticesinducing an almost (p − 1)-regular graph which contains a vertex y of degree p ... if H is not a subgraph of G,but for any edge uv in G, H is a subgraph of G + uv. For a fixed integer n, the problem of determining the maximum size of an H-saturated graph of order n is equivalent...
- 12
- 163
- 0
Báo cáo toán học: "Repetition number of graphs" pot
... set of q edges with weight at least s in a graph G. If the totalweight of edges in Q is at most cq, then rep(L(G)) ≥ maxk>s2(k−c)(k−s)(k−s+1)q.Proof. Let Xibe the number of edges of ... define the repetition number of a graph G, written rep(G), to be the maximum multiplicity in the list of vertex degrees.We study the minimum of rep(G) on various classes of n-vertex graphs. The ... path of three edges to triangulate each hexagonal tile,contributing to the degrees of the vertices in the two central rows of vertices in the strip of hexagons. When the central edges of the...
- 14
- 173
- 0
Báo cáo toán học: "Fixing Numbers of Graphs and Groups" pptx
... the transposition of the remaining two vertices. This implies thatthe only graphs which have fix(G) = n−1 are the complete graphs and the empty graphs. On the other hand, the graphs with fix(G) ... e),where v and e are a vertex and an edge of G, and v and e are incident. Inf(G) has anedge between (v1, e1) and (v2, e2) if v1= v2or e1= e2. We denote the k-fold inflation of the ... that v and u are adjacentvertices of Infk(Kn). By the definition of inflatio n, v = (v′, e′) and u = (u′, d′) for twovertices v′ and u′in Infk−1(Kn) and two edges e′ and d′in...
- 13
- 341
- 0
Báo cáo toán hoc:" Defective choosability of graphs without small minors" docx
... electronic journal of combinatorics 16 (2009), #R92 2 Defective choosability of graphs without small minorsRupert G. Woo d and Douglas R. WoodallSchool of Mathematical Sciences,University of Nottingham,Nottingham ... and S. Hedetniemi, Graphs with forbidden subgraphs. J.Combin. Theory Ser. B 10 (1971) 12–41.[3] G. A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. ... G such that one endvertex of P is aninternal vertex of Pab, the other endvertex is a vertex of H′that is not in Pab, and noother vertex of P i s in H′.Proof. If there were no such...
- 13
- 206
- 0
Báo cáo toán học: "Betti numbers of monomial ideals and shifted skew shapes" potx
... one can check is not of the form GbipX,Y(D) forany shifted skew- shape D. However, one can still think of the edges of G as correspondingto the cells of a diagram in the shifted plane, which ... considered as drawn in the shifted plane, butrather inside the m ì n rectangle with row and column indices given by X and Y .On the other hand, given a shifted skew diagram D, and a linearly ordered ... hypergraph generalizations of the ideals I(GnonbipX(D)) and I(GbipX,Y(D)) coming from shifted skew diagrams, as well as the Ferrers graph ideals I(Gλ),in order to ask and answer questions...
- 59
- 271
- 0
Báo cáo toán học: "Isoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann Surfaces" pot
... graphs. We then give applications to random regular graphs of high degree and to the Platonic graphs. We use the latter r esults to study the Cheegerconstants of arithmetic Riemann surfaces.Our ... Isoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann SurfacesDominic Lanphier∗Department of MathematicsWestern Kentucky UniversityBowling ... regular graphs of high degree as in [11], and Platonic graphs as in [8], [9], [13], and [15]. This gives Corollary 1 andTheorem 3.The model Gn,k of random regular graphs consists of all regular graphs...
- 16
- 210
- 0
Từ khóa: Nghiên cứu sự biến đổi một số cytokin ở bệnh nhân xơ cứng bì hệ thốngMộ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 HTTPNghiên cứu tổ chức chạy tàu hàng cố định theo thời gian trên đường sắt việt namđề thi thử THPTQG 2019 toán THPT chuyên thái bình lần 2 có lời giảiGiá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ô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 LPWANĐỒ ÁN NGHIÊN CỨU CÔNG NGHỆ KẾT NỐI VÔ TUYẾN CỰ LY XA, CÔNG SUẤT THẤP LPWANNghiên cứu tổng hợp các oxit hỗn hợp kích thƣớc nanomet ce 0 75 zr0 25o2 , ce 0 5 zr0 5o2 và khảo sát hoạt tính quang xúc tác của chúngNghiên cứu khả năng đo năng lượng điện bằng hệ thu thập dữ liệu 16 kênh DEWE 5000Chuong 2 nhận dạng rui roKiểm sát việc giải quyết tố giác, tin báo về tội phạm và kiến nghị khởi tố theo pháp luật tố tụng hình sự Việt Nam từ thực tiễn tỉnh Bình Định (Luận văn thạc sĩ)Giá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ậtTrách nhiệm của người sử dụng lao động đối với lao động nữ theo pháp luật lao động Việt Nam từ thực tiễn các khu công nghiệp tại thành phố Hồ Chí Minh (Luận văn thạc sĩ)Đổ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