Search Results for ""
1 - 10 of 15 for LobsterSearch Results
View search results from all Wolfram sites (23 matches)The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...
A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...
A polyiamond composed of six equilateral triangles. The 12 hexiamonds are illustrated above. They are given the names bar, crook, crown, sphinx, snake, yacht, chevron, ...
A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...
A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...
An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...
The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...
The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].
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 ...
...