Search Results for ""

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

A curve which intersects some straight line in an infinity of points (but for which not every point lies on this curve).

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...

The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

The n-path complement graph P^__n is the graph complement of the path graph P_n. The first few are illustrated above. Since P_4 is self-complementary, P^__4 is isomorphic to ...

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...