Search Results for ""
1271 - 1280 of 2168 for Permutation_graphSearch Results
A term in social choice theory meaning invariance of a result under permutation of voters.
A mathematical statement of the equivalence of two quantities. The equality "A is equal to B" is written A=B.
An operator of period 2, i.e., an operator * which satisfies ((a)^*)^*=a.
A polynomial in which the sum of subscripts is the same in each term.
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 (13976 matches)

