365 search results - page 10 / 73 » On the combinatorics of Galois numbers |
COMBINATORICS
2007
14 years 11 months ago
2007
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial iden...
COMBINATORICS
2004
14 years 11 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
127
click to vote
AOSD
2011
ACM
14 years 6 months ago
2011
ACM
A Software Product Line (SPL) is a family of programs where each program is defined by a unique combination of features. Testing or checking properties of an SPL is hard as it ma...
COMBINATORICS
2006
14 years 11 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
78
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...