Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Note On The Characterization Of Thistles By Their Matching Polynomials

E. J. Farrell1, S. A. Wahid1
1Department of Mathematics The University of the West Indies St. Augustine, Trinidad WEST INDIES
  • Published: 31/10/1990

Abstract

It is also shown that for a certain family of graphs (called thistles), the coefficients of the matching polynomial repeat themselves symmetrically. This turns out to be a characterizing property for some thistles.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
E. J. Farrell, S. A. Wahid. A Note On The Characterization Of Thistles By Their Matching Polynomials[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 008. 97-101. DOI: .