Search Results for ""

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

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

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

The number of nodes in a graph is called its order.

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

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

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 nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...