A generalization of the dichromatic polynomial of a graph
The Subgraph polynomial fo a graph pair (G,H), where H⫅G, is defined. By assigning particular weights to the variables, it is shown that this polynomial reduces to the dichromatic polynomial of G. This idea of a graph pair leads to a dual generalization of the dichromatic polynomial.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1981-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171281000550 |