Search Results for ""

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...