Search Results for ""

The Eiffel Tower graph is the graph on 7 vertices illustrated above. (Note that Koren et al. (2003) use the term 'Eiffel Tower graph' to refer instead to the (3,2)-fan ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

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 Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

The parachute graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParachuteGraph"].

The parapluie (French for 'umbrella') graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParapluieGraph"].

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

Knuth (2008, p. 44) terms the 24-vertex graph based on the notes of the musical scale illustrated above the "musical graph." This graph can be seen to be the 24-vertex case ...