Double-star snark
In the mathematical field of graph theory, the double-star snark is a snark with 30 vertices and 45 edges.[1]
| Double-star snark | |
|---|---|
 The Double-star snark | |
| Vertices | 30 |
| Edges | 45 |
| Radius | 4 |
| Diameter | 4 |
| Girth | 6 |
| Automorphisms | 80 |
| Chromatic number | 3 |
| Chromatic index | 4 |
| Book thickness | 3 |
| Queue number | 2 |
| Properties | Snark Hypohamiltonian |
| Table of graphs and parameters | |
In 1975, Rufus Isaacs introduced two infinite families of snarks—the flower snark and the BDS snark, a family that includes the two Blanuša snarks, the Descartes snark and the Szekeres snark (BDS stands for Blanuša Descartes Szekeres).[2] Isaacs also discovered one 30-vertex snark that does not belongs to the BDS family and that is not a flower snark — the double-star snark.
As a snark, the double-star graph is a connected, bridgeless cubic graph with chromatic index equal to 4. The double-star snark is non-planar and non-hamiltonian but is hypohamiltonian.[3] It has book thickness 3 and queue number 2.[4]
Gallery
The chromatic number of the double-star snark is 3.
The chromatic index of the double-star snark is 4.
gollark: Also, yet another cool idea!The overlay glasses now allow item icons. This could allow a remotely accessible (via introspection modules) with *actual item icons* instead of just text.
gollark: Ideally secure ones.
gollark: There's already a bunch of terminal streaming protocols available, right? I'm interested in upgrading ARC to in-world-positioned 3D screens transmitted from a beacon thing.
gollark: And?
gollark: I doūbt it allows full GPŪ access.
References
- Weisstein, Eric W. "Double Star Snark". MathWorld.
- Isaacs, R. (1975), "Infinite families of non-trivial trivalent graphs which are not Tait-colorable", American Mathematical Monthly, Mathematical Association of America, 82 (3): 221–239, doi:10.2307/2319844, JSTOR 2319844
- Weisstein, Eric W. "Hypohamiltonian Graph". MathWorld.
- Wolz, Jessica; Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.