Some equitably 3-colourable cycle decompositions of complete equipartite graphs

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.

Eigenvalues of Casimir invariants for Uq[osp(m|n)]

For each quantum superalgebra U-q[osp(m parallel to n)] with m > 2, an infinite family of Casimir invariants is constructed. This is achieved by using an explicit form for the Lax operator. The eigenvalue of each Casimir invariant on an arbitrary irreducible highest weight module is also calculated. (c) 2005 American Institute of Physics.

On the nonlinear Neumann problem involving the critical Sobolev exponent on the boundary

in this paper we investigate the solvability of the Neumann problem (1.1) involving the critical Sobolev exponents on the right-hand side of the equation and in the boundary condition. It is assumed that the coefficients Q and P are smooth. We examine the common effect of the mean curvature of the boundary a deltaOhm and the shape of the graph of the coefficients Q and P on the existence of solutions of problem (1.1). (C) 2003 Published by Elsevier Inc.

Some equitably 3-colourable cycle decompositions

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.

Sharp Sobolev inequality involving a critical nonlinearity on a boundary

We consider the solvability of the Neumann problem for the equation -Delta u + lambda u = 0, partial derivative u/partial derivative v = Q(x)vertical bar u vertical bar(q-2)u on partial derivative Omega, where Q is a positive and continuous coefficient on partial derivative Omega, lambda is a parameter and q = 2(N - 1)/(N - 2) is a critical Sobolev exponent for the trace embedding of H-1(Omega) into L-q(partial derivative Omega). We investigate the joint effect of the mean curvature of partial derivative Omega and the shape of the graph of Q on the existence of solutions. As a by product we establish a sharp Sobolev inequality for the trace embedding. In Section 6 we establish the existence of solutions when a parameter lambda interferes with the spectrum of -Delta with the Neumann boundary conditions. We apply a min-max principle based on the topological linking.

Steiner triple systems with two disjoint subsystems

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.

A graphical specification of model transformations with triple graph grammars

Models and model transformations are the core concepts of OMG's MDA (TM) approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification formalism. These triple graph grammars can be specified within the FUJABA tool and we argue that these rules can be more easily specified and they become more understandable and maintainable. To show the practicability of our approach, we present how to generate Tefkat rules from triple graph grammar rules, which helps to integrate triple graph grammars with a state of a art model transformation tool and shows the expressiveness of the concept.