547 search results - page 100 / 110 » dm 2008 |
108
Voted
DM
2008
15 years 1 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
91
Voted
DM
2008
15 years 1 months ago
2008
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
78
Voted
DM
2008
15 years 1 months ago
2008
We prove the following result concerning the inheritance of hyper-duality by block and quotient Bose-Mesner algebras associated with a hyper-dual pair of imprimitive Bose-Mesner a...
109
Voted
DM
2008
14 years 11 months ago
2008
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
83
Voted
DM
2008
15 years 1 months ago
2008
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...