More connections between the matching polynomial and the chromatic polynomial
Por:
Carely Luna-Olivera, Beatriz, Merino, Criel, Ramirez-Ibanez, Marcelino
Publicada:
1 dic 2019
Categoría:
Discrete mathematics and combinatorics
Resumen:
The connection between the matching polynomial and the chromatic
polynomial for triangle-free graphs was revealed in the work of Farrell
and Whitehead. We extend this result to all graph by mirroring the
corresponding result of Godsil and Gutman for the acyclic polynomial and
the characteristic polynomial. We also reintroduce the clique polynomial
of Farrell as an evaluation of the U-polynomial of Noble and Welsh,
which also happens to contain the matching and chromatic polynomials.
(C) 2018 Kalasalingam University. Publishing Services by Elsevier B.V.
Filiaciones:
Carely Luna-Olivera, Beatriz:
Univ Papaloapan, Inst Agroingn, Av Ferrocarril S-N, Loma Bonita 68400, Oaxaca, Mexico
Merino, Criel:
Univ Nacl Autonoma Mexico, Inst Matemat, Area Invest Cient, Mexico City 04510, DF, Mexico
Ramirez-Ibanez, Marcelino:
Univ Papaloapan, Inst Agroingn, Av Ferrocarril S-N, Loma Bonita 68400, Oaxaca, Mexico
|