Search Results for ""

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

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