Blanuša snarks
Introduction In the mathematical field of graph theory, the '''Blanuša snarks''' are two 3-regular graphs with 18 vertices and 27 edges. They were discovered by Yugoslavian mathematician Danilo Blanuša in 1946 and are named after him. When discovered, only one snark was known—the Petersen graph.As snarks, the Blanuša snarks are connected, bridgeless cubic graphs with chromatic index equal to 4.Both of them have chromatic number 3, diameter 4 and girth 5.They are non-hamiltonian but are hypohamiltonian. Both have book thickness 3 and queue number 2.
Algebraic properties The automorphism group of the first Blanuša snark is of order 8 and is isomorphic to the Dihedral group ''D''4, the group of symmetries of a square.The automorphism group of the second Blanuša snark is an abelian group of order 4 isomorphic to the Klein four-group, the direct product of the Cyclic group '''Z'''/2'''Z''' with itself.The characteristic polynomial of the first and the second Blanuša snark are respectively : ::
Generalized Blanuša snarks There exists a generalisation of the first and second Blanuša snark in two infinite families of snarks of order 8''n''+10 denoted  and . The Blanuša snarks are the smallest members those two infinite families.In 2007, J. Mazák proved that the circular chromatic index of the type 1 generalized Blanuša snarks  equals .In 2008, M. Ghebleh proved that the circular chromatic index of the type 2 generalized Blanuša snarks  equals .
Gallery Image:First Blanusa snark 3COL.svg|The chromatic number of the first Blanuša snark is 3.Image:First Blanusa snark 4edge color.svg|The chromatic index of the first Blanuša snark is 4.Image:Second Blanusa snark 3COL.svg|The chromatic number of the second Blanuša snark is 3.Image:Second Blanusa snark 4edge color.svg|The chromatic index of the second Blanuša snark is 4.
References