Search Results for ""
1321 - 1330 of 2230 for Triangular Graph GraphSearch Results
A n-gonal cupola adjoined to a 2n-gonal antiprism.
A hexagonal grid is a grid formed by a tessellation of regular hexagons. Boards made of hexagonal grids are often found in strategy and role-playing games because of the lack ...
A square grid is a grid formed by tiling the plane regularly with squares.
A dipyramid, also called a bipyramid, consists of two pyramids symmetrically placed base-to-base. The dipyramids are duals of the regular prisms. Their skeletons are the ...
The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...
A matching is a maximum matching iff it contains no augmenting path.
The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...
A fork of a tree T is a node of T which is the endpoint of two or more branches.
The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...
A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].
...
View search results from all Wolfram sites (13650 matches)

