Connections between the matching and chromatic polynomials
The main results established are (i) a connection between the matching and chromatic polynomials and (ii) a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
Saved in:
Main Authors: | E. J. Farrell, Earl Glen Whitehead |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1992-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S016117129200098X |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
On the reconstraction of the matching polynomial and the reconstruction conjecture
by: E. J. Farrell, et al.
Published: (1987-01-01) -
Matchings in hexagonal cacti
by: E. J. Farrell
Published: (1987-01-01) -
Some general classes of comatching graphs
by: E. J. Farrell, et al.
Published: (1987-01-01) -
On identifying name equivalences in digital libraries. Name equivalence, Surname matching, Author identification, Databases
by: Dror G. Feitelson
Published: (2004-01-01)