Search Results for ""

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...