Dichroic Polynomial

A Polynomial in two variables for abstract Graphs. A Graph with one Vertex has . Adding a Vertex notattached by any Edges multiplies the by . Picking a particular Edge ofa Graph , the Polynomial for is defined by adding the Polynomial ofthe Graph with that Edge deleted to times the Polynomialof the graph with that Edge collapsed to a point. Setting gives the number of distinctVertex colorings of the Graph. The dichroic Polynomial ofa Planar Graph can be expressed as the Square Bracket Polynomial of the corresponding Alternating Linkby

References

Adams, C. C. The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots. New York: W. H. Freeman, pp. 231-235, 1994.

• Enantiomer
• Enantiomorph
• Encoding
• Endogenous Variable
• Endomorphism
• Endraß Octic
• Energy
• En-Function
• Engel's Theorem
• Enneacontagon
• Enneacontahedron
• Enneadecagon
• Enneagon
• Enneagonal Number
• Enneakaidecagon
• Enneper's Minimal Surface
• Enneper's Negative Curvature Surfaces
• Enneper-Weierstraß Parameterization
• Enormous Theorem
• Enriques Surfaces
• Entire Function
• Entringer Number
• Entropy
• Entscheidungsproblem
• Enumerative Geometry