Search Results for ""

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

A double-toroidal graph is a graph with graph genus 2 (West 2000, p. 266). Planar and toroidal graphs are therefore not double-toroidal. Some known double-toroidal graphs on ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...

The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...

An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...