Báo cáo toán học: "Fixing Numbers of Graphs and Groups" pptx

... DOTA-octreotide, DTPA-anti-CAIX and DOTA-anti-CAIX in 0.1-M NaAc, NH 4 Ac, 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...

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

... NANO EXPRESS Open Access Selective preparation of zero- and one- dimensional gold nanostructures in a TiO 2 nanocrystal-containing photoactive mesoporous template Go Kawamura 1* , Teruhisa Okuno 2 , ... nanostructures [GNSs] were mainly obtained in the mesopores when a small amount of TiO 2 -containing mesoporous SiO 2 -TiO 2 was used as a template, whereas...

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

... alt =""

Ngày tải lên: 05/08/2014, 09:46

... the class of all 4-chromatic graphs. The structure of the red graph is obvious by Corollary, but we do not know which graphs can occur as blue graphs and what are the properties of graphs in which ... on the Wall, a list of conjectures of Graffiti. Ramseyan Properties of Graphs by Ermelinda DeLaVina delavina@math.uh.edu Siemion Fajtlowicz siemion@math.uh.edu Uni...

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

... The notion of orthogonal colorings is strongly related to the notion of orthogonal Latin squares. The orthogonal chromatic number of G, denoted by Oχ(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 Latin squares. Recall that two Latin squares L 1 ,L 2 of order r are...

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

... parts are all of size one. Alternately, the complement of such a graph either has no edges or consists of the the disjoint union of three or fewer complete graphs. Proof. The complement of K − 5 is ... 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...

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

... |Γ|≤m! and the subset {y 1 , ,y j } satisfies 1. φ(y i )=i for each i, 2. y i+1 is in Γ i−1 .y i for each i from 2 to j − 1, and y 1 is in Γ j−1 .y j , then j ≤ m and |Γ i−1 .y i |≥j − i + 2for each ... shows this and two other graphs with the same automorphism group and demonstrates that all three have different distinguishing numbers. This example disproves a conjecture in [...

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

... pleasing characterization of these integer vectors. We do have a couple of observations about this the electronic journal of combinatorics 12 (2005), #R17 29 Splitting Numbers of Grids Dwight Duffus Mathematics ... 1)y k +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...

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

... Hence, the class of (maximal) planar graphs is contained in the class of maximal K 3,3 -minor-free graphs and we can use the number of planar graphs and the number of triangulations as lower bounds. ... preliminary version available at http://algo.inria.fr/flajolet/Publications [7] O. Gim´enez and M. Noy. The number of planar graphs and properties of random planar...

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

... set X of b − 1 vertices, each of degree n − 1, a clique L of p 2 vertices, a the electronic journal of combinatorics 15 (2008), #R118 7 Saturation Numbers of Books Guantao Chen ∗ Dept. of Math. ... has a set X of b−1 vertices, each of degree n − 1, a clique L of p 2 vertices, a set T of n − p/2 − b + 1 vertices inducing an almost (p − 1)-regular graph which contains a v...

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

... set of q edges with weight at least s in a graph G. If the total weight of edges in Q is at most cq, then rep(L(G)) ≥ max k>s 2(k−c) (k−s)(k−s+1) q. Proof. Let X i be 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-ver...

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

... the transposition of the remaining two vertices. This implies that the 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 an edge between (v 1 , e 1 ) and (v 2 , e 2 ) if v 1 = v 2 or e 1 = e 2 . We denote the...

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

... electronic journal of combinatorics 16 (2009), #R92 2 Defective choosability of graphs without small minors Rupert G. Woo d and Douglas R. Woodall School 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 s...

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

... one can check is not of the form G bip X,Y (D) for any shifted skew- shape D. However, one can still think of the edges of G as corresponding to the cells of a diagram in the shifted plane, which ... considered as drawn in the shifted plane, but rather inside the m ì n rectangle with row and column indices given by X and Y . On the other hand, given a shifted skew diagr...

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

... 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 Cheeger constants of arithmetic Riemann surfaces. Our ... Isoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann Surfaces Dominic Lanphier ∗ Department of Mathem...

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