Today I've been playing with the induced subgraphs of the Clebsch graph. Several other interesting and well-known graphs can be obtained from it by deleting a small number of vertices and forming the induced subgraph of the remaining vertices.
To begin with, one simple construction of the Clebsch graph is to take all length-four binary strings as vertices, and to make two strings neighbors when they differ either by a single bit or by all four bits. So it has sixteen vertices and 40 edges, and
Major Threat(s): Historically, large commercial catches occurred when porpoises migrated through the Danish Straits, mainly during winter and spring months. Annual catch levels averaged about 1,000… See on havehest.wordpress.comFiled under: Nature Conservation