Search Results for ""

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 bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

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 E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede 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 gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].

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

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...