Search Results for ""

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

The great snub dodecicosidodecahedral graph is the skeleton of the great snub dodecicosidodecahedron, illustrated above in a few embeddings. It will be implemented in a ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...