1734 search results - page 279 / 347 » its 2000 |
COMBINATORICS
2000
13 years 9 months ago
2000
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
COMBINATORICS
2000
13 years 9 months ago
2000
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
COMBINATORICS
2000
13 years 9 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
COMBINATORICS
2000
13 years 9 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
COMCOM
2000
13 years 9 months ago
2000
Service provisioning is currently a challenging issue to offer future telecommunication services efficiently and at the same time in a flexible and user friendly manner. As a cont...