Matchings in hexagonal cacti (Q579281)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Matchings in hexagonal cacti |
scientific article; zbMATH DE number 4014769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matchings in hexagonal cacti |
scientific article; zbMATH DE number 4014769 |
Statements
Matchings in hexagonal cacti (English)
0 references
1987
0 references
Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown. Tables of the polynomials are given for each type of graph. Explicit formulae are then obtained for the number of defect-d matchings in the graphs, for various values of d. In particular, formulae are derived for the number of perfect matchings in all three types of graphs. Finally, results are given for the total number of matchings in the graphs.
0 references
matching polynomials
0 references
hexagonal cacti
0 references
linear cactus
0 references
star cactus
0 references
hexagonal crown
0 references
defect-d matchings
0 references
perfect matchings
0 references
0.8929268
0 references
0.87793833
0 references
0 references
0.84116495
0 references
0.8301034
0 references
