Search Results for ""

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

The join G=G_1+G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph union G_1 union G_2 together with all the edges joining ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

The domino graph is the graph on 6 vertices illustrated above. It is isomorphic to the 3-ladder graph and the (2,3)-grid graph. It is implemented in the Wolfram Language as ...

The paw graph is the 3-pan graph, which is also isomorphic to the (3,1)-tadpole graph. It is implemented in the Wolfram Language as GraphData["PawGraph"].

The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].

The fork graph, sometimes also called the chair graph, is the 5-vertex tree illustrated above. It could perhaps also be known as the 'h graph' (but not to be confused with ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...