Search Results for ""
1311 - 1320 of 2322 for Intersection_graphSearch Results
The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.
The term "vesica piscis," meaning "fish bladder" in Latin, is used for the particular symmetric lens formed by the intersection of two equal circles whose centers are offset ...
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"].
The Steinmetz solid is the solid common to two (or three) right circular cylinders of equal radii intersecting at right angles is called the Steinmetz solid. Two cylinders ...
The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...
...
View search results from all Wolfram sites (15241 matches)

