Search Results for ""

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, ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

The cube of a graph is defined as its third graph power.

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

A quartic nonhamiltonian graph is a quartic graph that is nonhamiltonian. A number of such graphs are illustrated above. Van Cleemput and Zamfirescu (2018) gave a 39-vertex ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

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 ...