15 resultados para Vertex Coloring
em University of Queensland eSpace - Australia
Resumo:
Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),..., c(k). If an m-cycle C in G has n(i) vertices coloured c(i), i = 1, 2,..., k, and (i) - n(j) less than or equal to 1 for any i, j is an element of {1, 2,..., k}, then C is equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in C is equitably k-coloured. For m = 4,5 and 6, we completely settle the existence problem for equitably 3-colourable m-cycle decompositions of complete graphs and complete graphs with the edges of a 1-factor removed. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
The XXZ Gaudin model with generic integrable boundaries specified by generic non-diagonal K-matrices is studied. The commuting families of Gaudin operators are diagonalized by the algebraic Bethe ansatz method. The eigenvalues and the corresponding Bethe ansatz equations are obtained. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
We apply a three-dimensional approach to describe a new parametrization of the L-operators for the two-dimensional Bazhanov-Stroganov (BS) integrable spin model related to the chiral Potts model. This parametrization is based on the solution of the associated classical discrete integrable system. Using a three-dimensional vertex satisfying a modified tetrahedron equation, we construct an operator which generalizes the BS quantum intertwining matrix S. This operator describes the isospectral deformations of the integrable BS model.
Resumo:
Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),.. , c(k). If an m-cycle C in G has n(i) vertices coloured c(i), i = 1, 2,..., k, and vertical bar n(i) - n(j)vertical bar <= 1 for any i, j is an element of {1, 2,..., k}, then C is said to be equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in W is equitably k-coloured. For m = 3, 4 and 5 we completely settle the existence question for equitably 3-colourable m-cycle decompositions of complete equipartite graphs. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
The A(n-1) Gaudin model with integrable boundaries specified by non-diagonal K-matrices is studied. The commuting families of Gaudin operators are diagonalized by the algebraic Bethe ansatz method. The eigenvalues and the corresponding Bethe ansatz equations are obtained. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
Given a partial K-4-design (X, P), if x is an element of X is a vertex which occurs in exactly one block of P, then call x a free vertex. In this paper, a technique is described for obtaining a cubic embedding of any partial K-4-design with the property that every block in the partial design contains at least two free vertices.
Resumo:
Working in the F-basis provided by the factorizing F-matrix, the scalar products of Bethe states for the supersymmetric t-J model are represented by determinants. By means of these results, we obtain determinant representations of correlation functions for the model.
Resumo:
Sec1p/Munc18 (SM) proteins are believed to play an integral role in vesicle transport through their interaction with SNAREs. Different SM proteins have been shown to interact with SNAREs via different mechanisms, leading to the conclusion that their function has diverged. To further explore this notion, in this study, we have examined the molecular interactions between Munc18c and its cognate SNAREs as these molecules are ubiquitously expressed in mammals and likely regulate a universal plasma membrane trafficking step. Thus, Munc18c binds to monomeric syntaxin4 and the N-terminal 29 amino acids of syntaxin4 are necessary for this interaction. We identified key residues in Munc18c and syntaxin4 that determine the N-terminal interaction and that are consistent with the N-terminal binding mode of yeast proteins Sly1p and Sed5p. In addition, Munc18c binds to the syntaxin4/SNAP23/VAMP2 SNARE complex. Pre-assembly of the syntaxin4/Munc18c dimer accelerates the formation of SNARE complex compared to assembly with syntaxin4 alone. These data suggest that Munc18c interacts with its cognate SNAREs in a manner that resembles the yeast proteins Sly1p and Sed5p rather than the mammalian neuronal proteins Munc18a and syntaxin1a. The Munc18c-SNARE interactions described here imply that Munc18c could play a positive regulatory role in SNARE assembly.
Resumo:
We review the recent progress on the construction of the determinant representations of the correlation functions for the integrable supersymmetric fermion models. The factorizing F-matrices (or the so-called F-basis) play an important role in the construction. In the F-basis, the creation (and the annihilation) operators and the Bethe states of the integrable models are given in completely symmetric forms. This leads to the determinant representations of the scalar products of the Bethe states for the models. Based on the scalar products, the determinant representations of the correlation functions may be obtained. As an example, in this review, we give the determinant representations of the two-point correlation function for the U-q(gl(2 vertical bar 1)) (i.e. q-deformed) supersymmetric t-J model. The determinant representations are useful for analyzing physical properties of the integrable models in the thermodynamical limit.
Resumo:
Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),..., c(k). If an m-cycle C in G has x(i) vertices coloured c(i), i = 1, 2,..., k, and vertical bar x(i) - x(j)vertical bar
Resumo:
It is shown that there exists a triangle decomposition of the graph obtained from the complete graph of order v by removing the edges of two vertex disjoint complete subgraphs of orders u and w if and only if u, w, and v are odd, ((v)(2)) - ((u)(2)) - ((w)(2)) equivalent to 0 (mod 3), and v >= w + u + max {u, w}. Such decompositions are equivalent to group divisible designs with block size 3, one group of size u, one group of size w, and v - u - w groups of size 1. This result settles the existence problem for Steiner triple systems having two disjoint specified subsystems, thereby generalizing the well-known theorem of Doyen and Wilson on the existence of Steiner triple systems with a single specified subsystem. (c) 2005 Wiley Periodicals, Inc.
Resumo:
We propose that the Baxter's Q-operator for the quantum XYZ spin chain with open boundary conditions is given by the j -> infinity limit of the corresponding transfer matrix with spin-j (i.e., (2j + I)-dimensional) auxiliary space. The associated T-Q relation is derived from the fusion hierarchy of the model. We use this relation to determine the Bethe Ansatz solution of the eigenvalues of the fundamental transfer matrix. The solution yields the complete spectrum of the Hamiltonian. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
The circulant graph Sn, where S ⊆ Zn \ {0}, has vertex set Zn and edge set {{x, x + s}|x ∈ Zn, s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph Sn in which S has an element of order n.
Resumo:
The Perk-Schultz model may be expressed in terms of the solution of the Yang-Baxter equation associated with the fundamental representation of the untwisted affine extension of the general linear quantum superalgebra U-q (gl(m/n)], with a multiparametric coproduct action as given by Reshetikhin. Here, we present analogous explicit expressions for solutions of the Yang-Baxter equation associated with the fundamental representations of the twisted and untwisted affine extensions of the orthosymplectic quantum superalgebras U-q[osp(m/n)]. In this manner, we obtain generalizations of the Perk-Schultz model.