Loupekine snark (first) | |
Vertices: | 22 |
Edges: | 33 |
Radius: | 3 |
Diameter: | 4 |
Girth: | 5 |
Chromatic Number: | 3 |
Chromatic Index: | 4 |
Properties: | not planar |
Loupekine snark (second) | |
Vertices: | 22 |
Edges: | 33 |
Radius: | 3 |
Diameter: | 4 |
Girth: | 5 |
Chromatic Number: | 3 |
Chromatic Index: | 4 |
Properties: | not planar |
In the mathematical field of graph theory, the Loupekine snarks are two snarks, both with 22 vertices and 33 edges.
The first Loupekine snark graph can be described as follows (using the SageMath's syntax[1]):
lou1 = Graph.
The second Loupekine snark is obtained (up to an isomorphism) by replacing edges 5–6 and 11–12 by edges 5–12 and 6–11 in the first graph.
Both snarks share the same invariants (as given in the boxes). The set of all the automorphisms of a graph is a group for the composition. For both Loupekine snarks, this group is the dihedral group
D6
D6
1
2,3,4
17, 18, 19, 20, 21, 22
5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16
The characteristic polynomials are different, namely:
\chi1=(x-3)(x+2)3(x3+x2-4x-2)(x3-2x2-x+1)2 ⋅ (x-2)(x2+2x-2)(x3-3x+1)2
\chi2=(x-3)(x+2)3(x3+x2-4x-2)(x3-2x2-x+1)2 ⋅ x(x2-2)(x3-5x+3)2