178 search results - page 15 / 36 » combinatorics 2007 |
COMBINATORICS
2007
13 years 11 months ago
2007
Let F4 be the root system associated with the 24-cell, and let M(F4) be the simple linear dependence matroid corresponding to this root system. We determine the automorphism group...
COMBINATORICS
2007
13 years 11 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
COMBINATORICS
2007
13 years 11 months ago
2007
The dartboard problem is to arrange n numbers on a circle to obtain maximum risk, which is the sum of the q-th power of the absolute differences of adjacent
COCOON
2007
Springer
14 years 5 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
CPM
2007
Springer
14 years 5 months ago
2007
Springer
Full-text searching consists in locating the occurrences of a