3356 search results - page 94 / 672 » Determining Consensus Numbers |
DAM
2008
13 years 9 months ago
2008
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswed...
EJC
2006
13 years 9 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
DM
2007
13 years 9 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
AAECC
2005
Springer
13 years 8 months ago
2005
Springer
In this paper we determine the number of isomorphism classes of Picard curves, i.e., superelliptic curves y3 = f(x) of genus three, over finite fields of characteristic different f...
ENDM
2002
13 years 8 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...