Sciweavers

3267 search results - page 173 / 654
» Generalized quasirandom graphs
Sort
View
JCT
2006
73views more  JCT 2006»
15 years 6 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 6 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
ACS
2000
15 years 6 months ago
Free Adjunction of Morphisms
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
Lutz Schröder, Horst Herrlich
CAGD
2000
61views more  CAGD 2000»
15 years 6 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...
SIAMDM
2010
167views more  SIAMDM 2010»
15 years 1 months ago
Domination Game and an Imagination Strategy
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall