Homomorphism and sigma polynomials
By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress can be made on identifying homomorphism polyno...
Saved in:
Main Author: | Richard Alan Gillman |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1995-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171295000834 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01) -
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
A note on the homomorphism theorem for hemirings
by: D. M. Olson
Published: (1978-01-01) -
Connections between the matching and chromatic polynomials
by: E. J. Farrell, et al.
Published: (1992-01-01) -
Some general classes of comatching graphs
by: E. J. Farrell, et al.
Published: (1987-01-01)