68 search results - page 6 / 14 » Symplectic graphs and their automorphisms |
AMW
2011
12 years 11 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
JSC
2007
13 years 7 months ago
2007
Abstract. We extend our recent work on set-theoretic solutions of the YangBaxter or braid relations with new results about their automorphism groups, strong twisted unions of solut...
EJC
2008
13 years 7 months ago
2008
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...
EJC
2006
13 years 7 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
COMBINATORICS
2002
13 years 7 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...