2 problems
Order-bound conjecture. Then
Authors' classification conjecture. When is large enough, is one of the following graphs: the odd polygons; folded -cubes; the odd graphs ; the Hamming gr…
Order-bound conjecture. Then
Authors' classification conjecture. When is large enough, is one of the following graphs: the odd polygons; folded -cubes; the odd graphs ; the Hamming gr…