Article contents
On a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomials
Published online by Cambridge University Press: 17 April 2009
Abstract
Let G be a graph. With every connected subgraph of G, let us associate a weight (Wα and with every spanning subgrapha or cover) C of G, a weight
where αi (i = 1, 2, …, n) are the components of C. The subgraph polynomial of G is
where the summation is taken over all the spanning subgraphs in G.
The basic properties of subgraph polynomials are given, expressions for the subgraph polynomials of multigraphs and pseudographs are derived, and the chromatic and dichromatic polynomials are shown to be special cases of the subgraph polynomial.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 26 , Issue 3 , December 1982 , pp. 343 - 354
- Copyright
- Copyright © Australian Mathematical Society 1982
References
- 2
- Cited by