Search Results for ""

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

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

The Schläfli double sixes graph is the Levi graph of the double sixes configuration.

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

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

The banner graph is the (4,1)-tadpole graph illustrated above. It could perhaps also be termed the 'P graph.' It is implemented in the Wolfram Language as ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...