Kalpana Kalpana (Editor)

Blanuša snarks

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Named after
  
Danilo Blanuša

Edges
  
27 (both)

Diameter
  
4 (both)

Vertices
  
18 (both)

Radius
  
4 (both)

Girth
  
5 (both)

Blanuša snarks

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 Croatian mathematician Danilo Blanuša in 1946 and are named after him. When discovered, only one snark was known—the Petersen graph.

Contents

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.

Algebraic properties

The automorphism group of the first Blanuša snark is of order 8 and is isomorphic to the Dihedral group D4, 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/2Z with itself.

The characteristic polynomial of the first and the second Blanuša snark are respectively :

( x − 3 ) ( x − 1 ) 3 ( x + 1 ) ( x + 2 ) ( x 4 + x 3 − 7 x 2 − 5 x + 6 ) ( x 4 + x 3 − 5 x 2 − 3 x + 4 ) 2   ( x − 3 ) ( x − 1 ) 3 ( x 3 + 2 x 2 − 3 x − 5 ) ( x 3 + 2 x 2 − x − 1 ) ( x 4 + x 3 − 7 x 2 − 6 x + 7 ) ( x 4 + x 3 − 5 x 2 − 4 x + 3 ) .  

Generalized Blanuša snarks

There exists a generalisation of the first and second Blanuša snark in two infinite families of snarks of order 8n+10 denoted B n 1 and B n 2 . The Blanuša snarks are the smallest members those two infinite families.

In 2007, J. Mazak proved that the circular chromatic index of the type 1 generalized Blanuša snarks B n 1 equals 3 + 2 n .

In 2008, M. Ghebleh proved that the circular chromatic index of the type 2 generalized Blanuša snarks B n 2 equals 3 + 1 ⌊ 1 + 3 n / 2 ⌋ .

References

Blanuša snarks Wikipedia
(Text) CC BY-SA